What is the maximum total number of nodes in a tree that has
N levels? Note that the root is level (zero)
- 18 Answers
- 47137 Views
- CSC, National Instruments, Sasken, Sybrant Technologies, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
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 |
Answer / uday
he didnt mention type of tree as binary tree so answer for
at 0level is 1, for other levels max is infinate
| Is This Answer Correct ? | 0 Yes | 0 No |
Answer / ubukkak
2^n - 1 is only binary tree
so
n! is number of tree with n node
| Is This Answer Correct ? | 0 Yes | 0 No |
Answer / m.eshwar
if the tree is binary tree [i.e two children max]then
2pow(N) is the answer
if it has 3 max children then
3pow(N)
...............................
if it has n max children then
npow(N)
| Is This Answer Correct ? | 4 Yes | 7 No |
What do you understand by doubly linked list?
Can treeset contain duplicates?
What is a dequeue?
Write a program for Sorting an Array. Which sorting will you prefer?
Given M x N matrix with sorted elements row wise and column wise, find elements?
Is arraylist better than array?
What happens if we put a key object in a hashmap which exists?
What is an ordered list?
Write programs for Bubble Sort, Quick sort
Define probing?
How can you represent a linked list node?
What is time complexity of quick sort?
Windows 
