Interested to Buy Any Domain ? << Click Here >> for more details...
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
What is binary tree and its types?
What is peek in stack?
Why is concurrenthashmap thread safe?
Which sorting algorithm is considered the fastest?
Difference between arrays and linked list?
Why we use arraylist instead of linked list?
What is nsmutablearray?
What is the quickest sorting algorithm?
Why insertion is faster in linked list?
State the advantages of using infix notations?
Explain binary searching and Fibinocci search?
What do you understand by doubly linked list?
Can arraylist store objects?
Does hashset allow duplicates?
Is an arraylist a vector?
