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
How to sort 1 million floating point numbers?
Is priority queue sorted?
What is a property class?
Why do we need a data structure?
Can you store different types in an array?
List out the disadvantages of using a linked list?
When is a graph said to be weakly connected?
What is data structure geeksforgeeks?
Differentiate between comparable and comparator.
Why it is said that searching a node in a binary search tree is efficient than that of a simple binary tree?
What actions are performed when a function is called?
What is the difference between for and foreach loop?
Explain the uses of b+ tree.
Can map contain duplicate keys?
How do you solve a selection sort?
