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
What is binary tree in computer science?
How can you insert a node to the beginning of a singly linked list?
What do you mean by quadratic probing?
What do you mean by data and data structure?
How do you do a selection sort?
What is difference between array and arraylist?
How do you check if a stack is empty or not?
What are the disadvantages array implementations of linked list?
What do you mean by disjoint set adt?
How can I study data structures and algorithms?
What is the time complexity of selection sort?
Difference between calloc and malloc in data structures?
Write the advantage of separate chaining?
What is peek in stack?
Does treeset allow null?
