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 is sorting necessary?
Differentiate null and void?
Why is arraylist faster than linkedlist?
Tell me why can't constant values be used to define an array's initial size
Which is the parent class of linkedlist class?
What do you mean by separate chaining?
What is difference between hashset and treeset?
Is treeset sorted?
How to find if linked list has loop?
Is array of data structure?
What is the difference between array list and vector list?
What is the logic to reverse the array?
Define linked list data structure.
How does dynamic memory allocation help in managing data?
Explain what do you mean by insertion sort, bubble sort and selection sort? Also, explain the differences among the functionalities of the three sorts.
