Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / sri
A binary tree is a tree which is either empty or each node
has at-most two children
The root node is the parent of all the nodes
its height is given by log n base 2 where n is the no of
elements
| Is This Answer Correct ? | 3 Yes | 0 No |
Post New Answer View All Answers
Why do we use data structures?
List the abstract operations in the set?
What are the disadvantages of linked list over array?
What is the difference between array list and vector list?
How does max heap work?
What are the applications of stack?
Is array immutable?
What is sorting and classifying?
What is difference between hashmap and map?
List out the advantages of using a linked list?
How does bogo sort work?
How many times is merge sort called?
How can I study data structures and algorithms?
What do you know about different sorting algorithms?
What is a binary search tree? Explain with example?
