(2 pow n)-1,if root level is one and (2 pow n+1)-1, if root level is zero

What is the maximum total number of nodes in a tree that has
N levels? Note that the root is level (zero)

Question Posted / asharani k p

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

Please Help Members By Posting Answers For Below Questions

Can we put null key in hashmap?

908

How can you add an item to the beginning of the list?

1018

Why is data structure needed?

973

Define primary data structures?

986

What is mean by abstract data type?

998

What are data and data types?

1054

What is type structure?

877

Why do we need sorting algorithms?

937

What are the different types of collections?

978

Mention for which header list, you will found the last node contains the null pointer?

851

Explain what are the notations used in evaluation of arithmetic expressions using prefix and postfix forms?

1055

Why do we use stacks?

926

Why would we use dynamically allocated arrays vs vectors?

886

Explain implementation of traversal of a binary tree.

1063

What are different types of sorting algorithms?

1009