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
Tell me what should be done in the base case for this recursive problem?
Is red black tree balanced?
How to find if linked list has loop?
What is the difference between the hash table and hash map?
What is difference between rb tree and avl tree?
What is selection in an algorithm?
State the rules to be followed during infix to prefix conversions?
Why is bubble sort stable?
What do you mean by Runtime Error
Can we sort hashmap?
What is impact of signed numbers on the memory?
What do you mean by general trees?
what is Linked lists?
List the data structures which are used in network data modal.
What is the default size of an arraylist?