Answer Posted / glibwaresoftsolutions
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
Why is quicksort better than mergesort?
What is the use of isEmpty() member methods?
What is a vector element?
What is difference between for loop and foreach?
Explain the uses of b+ tree.
Can tuple be sorted?
Does treeset allow null?
Why do we need to recycle?
What do u mean by array?
What is basic data structure?
Write program for Quick sort ?
Explain binary tree traversals?
Define right-in threaded tree?
When will you use array over arraylist?
Is list a data structure?