Interested to Buy Any Domain ? << Click Here >> for more details...
What is the maximum total number of nodes in a tree that has
N levels? Note that the root is level (zero)
- 18 Answers
- 51730 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
Does linkedhashset allow null values?
What is peek in stack?
What is the purpose of tochararray ()?
Explain the uses of matrix with an example?
What is unbounded queue?
How would you use bsearch() function to search a name stored in array of pointers to string?
How do you do a mergesort?
What is list and types of list?
What is binary tree and its types?
Explain the most efficient method to reverse a linked list?
What is sorting and its types?
Is arraylist better than array?
Which is best array or linked list?
Why merge sort is better than insertion sort?
Which is the slowest sorting algorithm?
