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
In what order the elements of a hashset are retrieved?
In what areas do data structures are applied?
What are the advantages of merge sort?
Can hashmap store null values?
What is the difference between binary tree and binary search tree?
Which sorting technique is best in worst case?
Does treeset remove duplicates?
How does a treemap sort?
What is meant by hashing?
What are data members?
Why do we need to use computers to help us sort lists?
What are the objectives of studying data structures?
State the rules to be followed during infix to prefix conversions?
What does map stand for?
How will you free the memory that is allocated at run time?