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
- 51479 Views
- CSC, National Instruments, Sasken, Sybrant Technologies, I also Faced
- E-Mail Answers
Answer Posted / mahfooz
2^N-1
because root is at level 0. and there are n levels only.
so last level i.e level of leaves should be n-1. for maximum
we will consider complete binary tree which is full at level
n-1.
for 0 level -> 2^0 i.e 1 element
for 1 level -> 2^1
...
so on
for n-1 levle ->2^(n-1) nodes
---------------------------
sum = 2^n-1
| Is This Answer Correct ? | 2 Yes | 2 No |
Post New Answer View All Answers
What is the use of tree data structure?
How to reverse a linked list iterative algorithm?
How can you correct these errors?
Describe the complexity of Quick Sort
Which collection is fail safe?
Can arraylist hold different types?
What do you mean by recursive definition?
What is the difference between file structure and storage structure?
What type of algorithm is binary search?
Why is bubble sort stable?
How are the elements of a 2d array are stored in the memory?
What sort of serious problems have you experienced, and how have you handled them?
How to print element of Array?
What do you mean by an Array?
What is an acyclic graph?
