Answer Posted / narendra sharma

Avl tree is self binary tree in which balancing factor lie
between the -1 to 1.It is also known as self balancing tree.
so BF=h(T(left sub tree))-h(T(right sub tree));

What is a concurrenthashmap?

1036

---

What is the basic of data structure?

1020

---

What is meant by a dynamic array?

948

---

List the data structures which are used in rdbms.

866

---

Briefly explain recursive algorithm?

1036

---

What are the categories of avl rotations?

992

---

write a program to show the insertion and deletion of an element in an array using the position

879

---

What is the use of isEmpty() member methods?

981

---

What is a subtree?

977

---

When new data are to be inserted into a data structure?

925

---

What is the difference between arrays sort and collections sort?

783

---

Explain what is a spanning tree?

996

---

What do you know about the big-o notation and can you give some examples with respect to different data structures?

933

---

Calculate the address of a random element present in a 2d array, given base address as ba.

1521

---

Can list contain null values?

880

---