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
Why is treeset sorted?
What is worst case complexity algorithm?
Traverse the given tree using Inorder, Preorder and Postorder traversals. Inorder : D H B E A F C I G J Preorder: A B D H E C F G I J Postorder: H D E B F I J G C A
Can treeset contain null?
Can arraylist have duplicates?
Give a basic algorithm for searching a binary search tree?
Describe the complexity of Quick Sort
Name few concurrent collection classes?
What is the idea behind splaying?
What is list and its types?
Which is faster binary or linear search?
What do you mean by garbage collection?
Explain the expression trees?
What is insertion sort technique?
What is array define its types?
