1. If a node having two children is deleted from a binary tree its replaced by its

A. Inorder predecessor
B. Preorder predecessor
C. Inorder successor
D. None of the above

2. The postfix expression AB + CD - * can be evaluated using a

A. Stack
B. Tree
C. Queue
D. Linked List

3. What is the most appropriate data structure to implement a priority queue ?

A. Heap
B. Circular Array
C. Linked List
D. Binary Tree

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

A. Leaf
B. Branch
C. Path
D. Thread

5. In Linked List data is stored in

A. Adjacent Location
B. Different Location in Memory
C. Neither A nor B
D. None of the above

6. A BST is traversed in the following order recursively: Right, Root, Left. The output sequence will be in

A. Ascending order
B. Descending order
C. Bitomic sequence
D. No specific order

7. The number of nodes in a Complete Binary Tree of level 5 is

A. 15
B. 25
C. 63
D. 71

8. Identify the data structure which allows deletions at both ends of the list but insertion at only one end.

A. Input-restricted deque
B. Output-restricted deque
C. Priority queues
D. None of above

9. The process of accessing data stored in a tape is similar to manipulating data on a

A. Stack
B. Queue
C. List
D. Heap

10. The post order traversal of a binary tree is DEBFCA. Find out the preorder traversal.

A. ABFCDE
B. ADBFEC
C. ABDECF
D. None of the above

11. Which of the following can be the sequence of nodes examined in binary search tree while searching for key 88 ?

A. 90, 40, 65, 50, 88
B. 90, 110, 80, 85, 88
C. 65, 140, 80, 70, 88
D. 190, 60, 90, 85, 88

12. Binary Search Tree is an example of

A. Divide and conquer
B. Greedy algorithm
C. Back tracking
D. Dynamic programming

13. The Searching technique that takes O(1) time to find a data is

A. Linear Search
B. Binary Search
C. Hashing
D. Tree Search

14. With regard to linked list, which of the following statement is false ?

A. An algorithm to search for an element in a singly linked list requires O(n) operations in the worst case.
B. An algorithm for deleting the first element in a singly linked list requires O(n) operations in the worst case.
C. An algorithm for finding the maximum value in a circular linked list requires O(n) operations.
D. An algorithm for deleting the middle node of a circular linked list requires O(n) operations.

15. Select the true statement

A. Every Binary Tree is either Complete or Full
B. Every Complete Binary Tree is also a full Binary Tree
C. Every Full Binary Tree is also a Complete Binary Tree
D. No Binary Tree is both Complete and Full