Answer Posted / nashiinformaticssolutions
An extension of the linked list structure, a binary tree contains no more than two children per node.
There are always two nodes in a binary tree: a left node and a right node.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
What is long data type?
What is stack explain with diagram?
List out the advantages of using a linked list?
What is meant by deque?
Tell me why might quick sort might be better than merge sort?
What is a pass in bubble sort?
Is arraylist better than array?
Which is faster list or set?
What is a priority queue?
You are given a singly linked list. How would you find out if it contains a loop or not without using temporary space?
Describe stack operation.
Is stack a dynamic data structure?
Which sorting algorithm is considered the fastest?
What is minimum depth of binary tree?
What are data and data types?