Interested to Buy Any Domain ? << Click Here >> for more details...
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
Can hashset contain null?
What is a subtree in data structures?
What stack means?
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
What is difference between list and set?
What is difference between array and arraylist?
What are the benefits of using arrays?
Is hashmap part of collection?
What is array and string?
What is meant by a dynamic array?
Explain what are the major data structures used in the hierarchical data model?
How efficient is binary search?
What is tree and its properties?
When will we get ArrayStoreException?
How do you balance a tree?
