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
- 51476 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 |
Explain linked list in short.
What are data structures in programming?
Define quadratic probing?
Define collision in hashing?
Can we add duplicate keys in a hashmap? What will happen if we attempt to add duplicate values?
What is lifo?
Can we modify final arraylist?
Why is arraylist used?
What is collision in data structure?
What is significance of ” * ” ?
What is the space complexity of bubble sort?
What is binary tree and its types?
Windows 
