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 complexity algorithm?
What are the major data structures used in the rdbms?
What are common data structures?
What is the difference between length () and size () of arraylist?
Explain the principle of quicksort. What is its complexity?
Define a linear and non linear data structure.
Why do we Use a Multidimensional Array?
what are the applications of Linked Lists?
Explain binary searching and Fibinocci search?
What is hash data type?
Why hashmap is faster than hashset?
Which sorting is used in collections sort?
How does selection sort work?
Can you provide some implementation of a dictionary having large number of words?
Define path in a graph?
