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 do you mean by sorting data?

498

---

What are the difference between malloc() and calloc()?

564

---

Define b-tree of order m?

574

---

Tell me do array subscripts always start with zero?

510

---

Which interfaces are implemented by linkedhashset?

527

---

---

What are linked lists most commonly used for?

496

---

Define back edge?

578

---

How many pointers are necessary to implement a simple linked list?

693

---

Write an algorithm that counts number of nodes in the circular linked list

505

---

Why do we use sorting?

484

---

what is the primary advantage of a linked list?

952

---

Is heap sort faster than quicksort?

478

---

Explain what is the type of the algorithm used in solving the 8 queens problem?

481

---

What is the difference between hashmap and treemap?

447

---

What is stack explain with diagram?

517

---