1. (i) A binary tree can contain at least 2L Nodes at level L.
(ii) A complete binary tree of depth d is a binary tree that contains 2L Nodes at each level L between 0 and d, both inclusive.
(iii) The total number of nodes (Tn ) in a complete binary tree of depth d is 2 d+1- 1 .
(iv) The height of the complete binary tree can be written as h = log 2 (Tn+1)-1 where Tn is Total number of nodes.

Which one of the following is correct in respect of the above statements regarding the Binary trees?

2. A queue where the de-queue operation depends not on FIFO, is called a priority queue

3. Suppose currentNode refers to a node in a linked list (using the Node class with member variables called data and nextNode). What statement changes currentNode so that it refers to the next node?

4. What is the maximum depth of recursive calls a function may make?

5. The expression AB+C* is called?

6. Suppose we have a circular array implementation of the queue class, with ten items in the queue stored at data[2] through data[11]. The CAPACITY is 42, i.e., the array has been declared to be of size 42. Where does the push member function place the new entry in the array?

7. “+” is a _________operator.

8. The nodes with no successor are called _________

9. In which of the traversal method, the recursive calls can be used to traverse a binary tree ?

10. Which one of the following calling methods does not change the original value of the argument in the calling function?

11. Suppose n is the number of nodes in a complete Binary Tree then maximum steps required for a search operation are,

12. A tree is an AVL tree if

13. A tree is an AVL tree if

14. Which one of the following statement is NOT correct .

15. We access elements in AVL Tree in,

16. In the call by value methodology, a copy of the object is passed to the called function.

17. A queue where the de-queue operation depends not on FIFO, is called a priority queue

18. AVL Tree is,

19. Let’s call the node as that requires re-balancing. Consider the two cases given below:
1) An insertion into left sub tree of the left child of a
2) An insertion into right sub tree of the right child of a.
Which of the following statement is correct about these two cases?

20. Each node in doubly link list has,

21. The data of the problem is of 2GB and the hard disk is of 1GB capacity, to solve this problem we should

22. In the linked list implementation of the stack class, where does the push member function places the new entry
on the linked list?

23. Each operator in a postfix expression refers to the previous ________ operand(s)

24. Doubly Linked List always has one NULL pointer

25. I have implemented the queue with a linked list, keeping track of a front pointer and a rear pointer. Which of these pointers will change during an insertion into an EMPTY queue?

26. _________ is a binary tree where every node has a value, every node's left subtree contains only values less
than or equal to the node's value, and every node's right subtree contains only values that are greater then or
equal?

27. Suppose that the class declaration of SomeClass includes the following function prototype bool LessThan( SomeClass anotherObject );
Which of the following tests in the client code correctly compares two class objects alpha and beta?

28. The tree data structure is a

29. When should you use a const reference parameter?

30. Which one is a self- referential data type?