What is the maximum total number of nodes in a tree that has
N levels? Note that the root is level (zero)
- 18 Answers
- 47025 Views
- CSC, National Instruments, Sasken, Sybrant Technologies, I also Faced
- E-Mail Answers
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 are the basic operations of stack?
Which are the sorted collections?
How does a treemap sort?
Why null is not allowed in treemap?
Can arraylist have null values?
Explain the uses of b+ tree.
Does linkedhashset allow duplicates?
What is two-dimensional array?
What is the height of binary tree?
Is hashmap sorted?
What is meant by heap sort?
What is a class user?
What is the meaning of anonymous array? Explain with an example?
What is difference between arraylist and linkedlist?
Explain Linked List
