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

How does variable declaration affect memory allocation?

1703

---

What is data structure what is need of it?

834

---

Write a code for dynamic allocation of array.

979

---

List the limitations of linear probing?

883

---

What is collections singletonlist?

820

---

Differentiate between file and structure storage structure.

901

---

How many types of data structure are there?

831

---

“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?

1145

---

What are the advantage of linked list over array?

798

---

Is there any difference between int[] a and int a[]?

1064

---

What are the different types of data structures?

935

---

Can arraylist store int?

943

---

Describe binary tree and its property.

862

---

Why is selection sort used?

821

---

What is the need for path compression?

1013

---