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
- 52098 Views
- CSC, National Instruments, Sasken, Sybrant Technologies, I also Faced
- E-Mail Answers
Answer Posted / hex
to be more generic this kind of problem is best solved
recursivly.
To point out that 2 ^ N AND 3 ^ N are both wrong,
here's a few examples: (the exponet is the amount of levels)
2^0 = 1, correct
2^1 = 2, incorrect, should be 3
2^2 = 4, incorrect, should be 7
And a tree with three children
3^0 = 1, correct
3^1 = 3, incorrect, should be 4
3^2 = 9, incorrect, should be 13
Looking at that I'm sure you can see the pattern.
Let
C = "Number of Possible Children"
N = Levels
N
Σ C^N
j=0
or in C++ code
int NodeCount(int C, int N)
{
if (N < 0) return 0
return NodeCount(C, N-1) + C^N
}
| Is This Answer Correct ? | 8 Yes | 4 No |
Post New Answer View All Answers
What is Another name of Dynamically allocating memory.
Why do we need to recycle?
What is definition list?
What is the order of b tree?
What are hashmaps good for?
Define root?
How does a treemap work?
Tell me is it better to use a pointer to navigate an array of values, or is it better to use a subscripted array name?
Differentiate between iterator and listiterator.
Define terminal nodes in a tree?
What is perfect binary tree?
What is difference between tree and binary tree?
Which interfaces are implemented by linkedhashset?
Can you sort a hashset?
Define heap?
