What is the maximum total number of nodes in a tree that has
N levels? Note that the root is level (zero)
Answer Posted / asharani k p
(2 pow n)-1,if root level is one and (2 pow n+1)-1, if root
level is zero.
| Is This Answer Correct ? | 26 Yes | 11 No |
Post New Answer View All Answers
What is data algorithm?
in tree construction which is the suitable efficient data structure? (Array, linked list, stack, queue)
Define hash table?
What is the default capacity of hashmap?
Why is sorting necessary?
Define b-tree of order m?
What is sorting and its types?
What are threaded binary trees?
Explain the term run-time stack?
What is meant by deque?
Can we change load factor of hashmap?
Can arraylist contain null?
Why do we study data structures?
How do you find the complexity of a bubble sort?
How to check array contains value or not?