What is the maximum total number of nodes in a tree that has
N levels? Note that the root is level (zero)
Answer Posted / 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 |
Post New Answer View All Answers
What is a data structure definition?
What is top in stack?
What is entryset in hashmap?
What is integer max_value?
What does the dummy header in linked list contain?
For addition and deletion. Which one is most preferred: array list or linked list?
What is map entry?
What is the difference between array sort () and array sort t >()?
What is placement new in data structures?
Explain about set and their types in a collection?
What are threaded binary trees?
Which is the slowest sorting algorithm?
What is breadth first tree?
How can you insert a node to the beginning of a singly linked list?
Explain extended binary tree.