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 binary tree example?
Which sort is stable?
How do you sort an arraylist in descending order?
What are vectors used for in real life?
What is the difference between data types and data structures?
How many types of lists are there?
What is the difference between hashmap and arraylist?
What are the pre-requisite for the collection to perform binary search?
What is the difference between sorting and classifying?
What are different sorting algorithms?
Can a null element added to a treeset or hashset?
Write an algorithm to find middle element in the linked list.
Does concat mutate array?
What happens in insertion sort?
Can you store different types in an array?