Answer Posted / jonu
if we are having an ordinal binary tree..
then No. Of nodes varies from 2^(h-1)-1 to 2^(h)-1
for example if h=3
then No. of node varies from 2^(3-1)-1 = 3 to 2^3-1 = 7
but for complete binary tree
No. Of node will be 2^h-1 only....
don't mind but Iti and Aniket your ans. is not actually correct...
| Is This Answer Correct ? | 2 Yes | 0 No |
Post New Answer View All Answers
Is binary tree a binary search tree?
Does arraylist extend list?
Tell me about circular linked list?
What is the difference between arraylist and hashmap?
Write any two principles of gradation of structures.
Is arraylist synchronized?
List the data structures which are used in rdbms.
Define structure property in a heap?
If we add enum constants to a sorted collection ( treemap , treeset ), what will be the order in which they will be maintained?
How many types of search algorithms are there?
What is difference between list set and map?
Explain extended binary tree.
What do you mean by the term “percolate up”?
How is heap sort implemented?
Is bubble sort adaptive?
