Suppose the queue implemented using two part chain then depends on the picture below the queueNode queue is empty? freeNode Select one True False Towers of Hanoi problem is better solved using recursive based technique Select one O A true O B false If two algorithms are written to solve a problem, the first one used iterative-based repetition and the second one used recursive-based repetition, and both algorithms have the same big Oh O(n), which one you choose to program and why? Select one: O a recursive algorithm because it is more space efficient than iterative one O b. recursive algorithm because it is more time efficient than iterative one O c. iterative algorithm because it is more space efficient than recursive one O d. iterative algorithm because it is more time efficient than recursive one What is wrong, if any, in the following method implementing the pop method of a Stack in a linked based implementation introduced in this course: Ll public Object pop(Object item) L2(Object top = null; L3; if (topNode null) L4 (top=topNode data: L5 topNode topNode next:) L6; return top:) Select one O A In L2: top has to be of type Node O B. In Ll: pop should have no parameter O C. in L3: (topNode = null) should be (topNode != null) O D. B and C in a binary mathematical expression tree, the internal nodes filled with ? Select one O a operands Ob.operators O c. operators and parentheses 1.91 O d.operators and operands to implement a priority queue using array we can? Select one O a sort the objects according to the priority associated with objects b. store data randomly and then search the highest priority O c. both sorting or searching O d. none E NEXT PAGE What does the following method computes in a Binary Search Tree static int Vlolo(BinaryNode node) (BinaryNode current = node; while (current.left te null) current = current.left: return (current.data): Select one O A. Computes the Minimum Value O B Computes the Maximum Value O c Computes the Average Value O D. Computes the Hight of a binary Tree The inorder Traversal of the following tree is Select one: OA(QYTRZ X) OBOTYRZX) OCQYT ZRX) OD XY TRZQ) To implement a priority queue efficiently which of the following data structures can be used? Select one: O a array O b. linked list O cheap O d. stack Given the following binary expression tree, what value is returned evaluating this ExpressionTree if w = 7,x = 2, y = 1, and 2 = 8? z w X Select one O A. (7.(2-1))+ 8 = 15 OB 17. (2-2)) + 8 = 8 OC. (7.(1-2)) + 8 = -15 O D. (8 (1-1)) + 7 = 7 NEXT PAGE To implement a priority queue efficiently which of the following data structures can be used Select one O a array b. linked list O cheap O d. stack Given the following binary expression tree, what value is returned evaluating this Expression Tree if w = 7,x=2, y = 1 and 2 = 8? w Y Select one: O A. (7.12 - 1)) + 8 = 15 O B.7.(2-2) + 8 = 8 OC.7+(1-2)) + 8 = -15 OD. (8. (1 - 1))+7=7 NEXT PAGE