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
- 51713 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 difference between hashset and hashtable?
Define hash table?
How can I learn data structures?
Explain the priority queue?
What is shell sort in data structure?
State the merit of linked representation of binary trees?
Which sorting is used in collections sort?
Which is best book for data structures?
How to create an Array?
What is the use of hashtable?
Can we store null in arraylist?
Why is bubble sort stable?
Does hashmap sort automatically?
What is data structure and data type?
What is a treemap chart?
