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.

How many types of data structures are used?

508

---

Can map contain duplicate keys?

456

---

What sorting algorithm does arrays sort use?

447

---

How do you find a string is anagram or not?

467

---

Which type of sorting is best?

504

---

---

In what areas do data structures applied?

492

---

Can binary tree have 1 child?

478

---

How do you do binary search?

472

---

What is sequential mapping in data structure?

451

---

Tell me what is quick sort?

536

---

Which is better hashset or treeset?

480

---

Which sorting is stable?

468

---

What is different between array and list?

479

---

Differentiate bfs and dfs?

546

---

Can we use ordered set for performing binary search?

530

---