1. An algorithm that calls itself directly or indirectly is known as ?

2. In a graph if e=(u, v) means ?

3. If every node u in G is adjacent to every other node v in G, A graph is said to be ?

4. In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in the tree for efficiency. These special pointers are called ?

5. The in order traversal of tree will yield a sorted listing of elements of tree in ?

6. A connected graph T without any cycles is called ?

7. In a Heap tree ?

8. Which of the following sorting algorithm is of divide-and- conquer type ?

9. The post order traversal of a binary tree is DEBFCA. Find out the per order traversal ?

10. In a graph if e=[u, v], Then u and v are called ?