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 the best case complexity of bubble sort?
What is difference between data type and variable?
Why is hashmap faster than treemap?
What are the advantages and disadvantages of linked list?
What is the space complexity of bubble sort?
Is quicksort a stable sorting algorithm?
What is an expression tree?
Define linear probing?
What is sorting and classifying?
Which is faster array or list?
What is difference between for loop and foreach?
What are common data structures?
What will you prefer for traversing through a list of elements between singly and doubly linked lists?
How to find if linked list has loop?
Define shortest path?
