What is the maximum total number of nodes in a tree that has
N levels? Note that the root is level (zero)
Answer Posted / gaurav gupta
(2^(N+1))-1
Suppose level is 2 then total number of nodes will be
1 root
2 left of root and right of root
2 left and right of left of root
2 left and right of right of root
so total nodes are 1+2+2+2=7
by formula (2^(2+1))-1
8-1=7
| Is This Answer Correct ? | 24 Yes | 10 No |
Post New Answer View All Answers
What is raid (redundant array of inexpensive disks)?
What should I learn first data structures or algorithms?
Explain the term recursive case?
Is array of data structure?
What are the different types of sorting in data structure?
What is 2 dimensional linked list?
What is time complexity of bubble sort?
What is array and its types with example?
What is the use of data structure in real life?
How many types of data structures are used?
Is quicksort a stable algorithm?
Define tree edge?
Why quicksort is faster than merge sort?
Define Data Structures?
What are the parts of a linked list?