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
- 51477 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
Name the areas in which you can apply data structures extensively?
What is homogeneous array?
How many types of linked list exist?
What is difference between array and string?
Differentiate bfs and dfs?
Are duplicates allowed in hashmap?
Why is it called bubble sort?
What is the logic to reverse the array?
Describe tree database. Explain its common uses.
What is the difference between for and foreach loop?
What is storage structure in data structure?
Why is data structure?
What is a sorting algorithm in data structure?
Is hashmap get thread safe?
What is quick sort?
