What is the maximum total number of nodes in a tree that has
N levels? Note that the root is level (zero)
- 18 Answers
- 47201 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 basic algorithms?
How is the front of the queue calculated in data structure?
How to search binary in a sorted array?
How many types of priority queue are there?
How to excel in data structures and algorithms?
What are AVL trees?
What is the difference between array and stack?
What are the tasks performed during inorder traversal?
Write an algorithm to show various operations on ordered list and arrays
What is immutablelist?
What do you understand by doubly linked list?
What are the standard ways in which a graph can be traversed?
Why is merge sort faster?
Which sorting algorithm has minimum number of swaps?
Why quicksort is faster than merge sort?
