(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

What are stacks? Give some of its applications.

973

What is a pseudocode example?

964

Can you provide some implementation of a dictionary having large number of words?

1095

Can we remove element from arraylist while iterating?

961

Is heap sort stable?

872

What is sorting an array?

901

What is a hashmap in c?

874

How many types of data structures are there?

1094

Why is hashmap faster?

914

What are the benefits of using arrays?

1040

What is difference between array and string?

987

What data structure does a binary tree degenerate?

890

Define non-terminal nodes in a tree?

1147

Tell me about the different sorting techniques.

908

Define non-linear data structures?

1024