11. The inorder traversal of a tree will yield a sorted listing of elements of which tree: a. Binary tree. b. Heaps c. Binary search tree d. All of the above. e. None of the above. 12. In the array implementation of a queue, which formula computes the index of the element in the array to insert the new value? a. (front + 1) % data. length b. (front + size()) % data.length c. (front-I) % data.length d. (front-size()) % data.length e. None of the above. 13. In an inorder traversal of a binary tree, the root node is visited: a. After the traversal of the right and left subtrees. b. Before the traversal of the right and left subtrees. c. In-between the traversal of the left and right subtrees. d. Before all other nodes in the tree. e. None of the above. 14. Which of the following is an application of a stack? a. Infix to postfix. b. Breadth first search. c. Print queue. d. Sorting e. None of the above. 15. A binary search tree in which the nodes have been inserted in the following order: 60, 55, 95, 40, 30, 100, 35, the node with the value 47 will be inserted to the: a. Left child of the node with the value 95 b. Right child of the node with the value 55 c. Right child of the node with the value 35 d. Left child of the node with the value 30. e. Right child of the node with the value 40