Answer Posted / mahfooz

2^N-1

because root is at level 0. and there are n levels only.
so last level i.e level of leaves should be n-1. for maximum
we will consider complete binary tree which is full at level
n-1.

for 0 level -> 2^0 i.e 1 element
for 1 level -> 2^1
...
so on

for n-1 levle ->2^(n-1) nodes
---------------------------
sum = 2^n-1

Describe full binary tree and complete binary tree.

878

---

What are three common types of traversals?

1000

---

Which interfaces are implemented by abstractsequentiallist?

889

---

What is example of data?

1090

---

What are linked lists most commonly used for?

893

---

Is array immutable?

895

---

Is unordered_map a hash table?

858

---

Define the term “percolate down”?

993

---

Can we use ordered set for performing binary search?

909

---

write an algorithm to show the procedure of insertion into a b-tree?

928

---

Does treemap preserve order?

843

---

What is a class user?

962

---

Explain the expression trees?

990

---

What is tree in computer science?

975

---

Why concurrenthashmap is fail safe?

959

---