Answer Posted / baskerdearer

number of possible tree = (2 power n) - n.
for example:
A tree contain three node.
so n=3.
possible tree = 8 - 3 = 5.

What is the time complexity of arrays sort?

470

---

How null key is handled in hashmap?

466

---

What is a list of lists?

518

---

What is difference between list and set?

471

---

Which is faster array or arraylist?

472

---

---

What are AVL trees?

575

---

What is binary search in programming?

499

---

What is data structure and why we need it?

496

---

what is the difference between singly and doubly linked lists?

539

---

Define disjoint set adt?

534

---

Explain the internal working of a hash map?

510

---

Is hashmap keyset ordered?

555

---

What is ds tree?

523

---

How can avl tree be useful in all the operations as compared to binary search tree?

476

---

What do you mean by structure property in a heap?

540

---