On clicking a node in a tree, all the adjacent edges are turned on. Calculate min of clicks such that all the edges are turned on.

972

---

Explain the implementation of an AVL tree and Binary tree.

947

---

Describe the complexity of Quick Sort

932

---

Explain different methods in which you can traverse a tree?

912

---

How can you implement a stack?

1072

---

What is a Breadth First Search? Give a few of its applications.

887

---

How would you check if a binary tree is BST or not ? Write a program.

901

---

What the principle of quick sort and its complexity?

992

---

Describe the complexity of Binary search

899

---

What is peep stack?

1004

---

What is the prerequisite for binary searching?

1041

---

Write a program for reversing the Single Linked List?

1103

---

What are stacks? Give some of its applications.

974

---

You are given a singly linked list. How would you find out if it contains a loop or not without using temporary space?

1109

---

Given an array of integers, devise a program to replace every element with the next greatest element on the right side in the array. Also, replace the last element with 5 as there no element on the right side of it.

1075

---