What is the maximum total number of nodes in a tree that has
N levels? Note that the root is level (zero)
- 18 Answers
- 47012 Views
- CSC, National Instruments, Sasken, Sybrant Technologies, I also Faced
- E-Mail Answers
Answer Posted / vaishali naidu
If root is at level 0 then :
Case 0:
When level is 1 max nodes is 1
Case 1:
When level is 1 then max would be 3.
Case 2:
When level is 2 then max nodes would be 7
So formula would be 2^(n+1) -1
2^(0+1)-1=1
2^(1+1)-1=3
2^(2+1)-1=7
| Is This Answer Correct ? | 6 Yes | 3 No |
Post New Answer View All Answers
What happens in insertion sort?
What are the advantages and disadvantages of linked list over array?
What is basic data structure?
Which searching algorithm is best?
Explain binary tree traversals?
Is binary tree a binary search tree?
What are the tasks performed during preorder traversal?
How do you declare A pointer to array of three chars
What is a pass in bubble sort?
What is a reverse linked list.
How do you reference all the elements in a one-dimension array?
Evaluate the following prefix expression " ++ 26 + - 1324" (Similar types can be asked)
What are the disadvantages of using collection classes over arrays?
Mention a few applications of linked lists?
How does quicksort partition work?
