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
Why it is said that searching a node in a binary search tree is efficient than that of a simple binary tree?
Define the graph data structure?
What are the different binary tree traversal techniques?
Is hashmap a collection?
How to pass in data structure exam?
How helpful is abstract data type of data structures?
What are the disadvantages of representing a stack or queue by a linked list?
Why do we need searching algorithms?
Devise a program to sort an array using bubble sort.
How to print element of Array?
Does arraylist have index?
Define the term “percolate up”?
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
Explain the most efficient method to reverse a linked list?
What is the best data structure and algorithm to implement cache?
