What is the maximum total number of nodes in a tree that has
N levels? Note that the root is level (zero)
Answer Posted / gaurav gupta
(2^(N+1))-1
Suppose level is 2 then total number of nodes will be
1 root
2 left of root and right of root
2 left and right of left of root
2 left and right of right of root
so total nodes are 1+2+2+2=7
by formula (2^(2+1))-1
8-1=7
| Is This Answer Correct ? | 24 Yes | 10 No |
Post New Answer View All Answers
Write a program to reverse a single linked list.
Why is arraylist faster than linkedlist?
How do you search for a target key in a linked list?
Explain the most efficient method to reverse a linked list?
Which interface treemap implements?
what is the difference between dynamic as well as non - dynamic data structures.
Describe the complexity of Binary search
Which sorting is worst?
Why do we need sorting?
How dynamic arrays are created?
Does list allow null values?
An array having 100 elements have numbers from 1 to 99 randomly out of which any number is repeated. Find the repeated number in minimum time and space complexity.
What are the objectives of studying data structures?
What are the disadvantages of representing a stack or queue by a linked list?
What is meant by ordered and sorted in collections?