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 a multidimensional array?
What is inplace sorting?
Explain the term tail recursion?
Differentiate between list and map.
What are binary search and fibonacci search?
What is the complexity of sorting algorithm?
What do you mean by 2-3 tree?
What is stack push?
What is time complexity of bubble sort?
Define collision in hashing?
Can sets contain duplicates?
Which interfaces are implemented by abstractqueue?
What is hash data type?
what is the difference between dynamic as well as non - dynamic data structures.
What is difference between tree and forest?
