MCQ:(NEED ANSWERS) 1. Let P stands for push and O for pop. When using a stack to calculate the value of the postfix expression 1 2 3 + * 4 -, the stack operation sequence is: a) PPPOOPOO b) PPPOOPOOPPOOPO C) PPOOPPOOPPOO d) PPPOOPOOPPOO Given input { 32, 82, 47, 51, 64, 18, 41 ). After the first partition (with the median-of-three as the pivot) of quick sort, the resulting sequence is a) { 32, 18, 41, 82, 64, 47, 51 } b) { 32, 18, 41, 51, 64, 82, 47 } c) { 18, 32, 47, 51, 64, 82, 41 } d) { 32, 18, 47, 41, 51, 82, 64} Insert { 18, 15, 8, 16, 17, 2} one by one into an initially empty AVL tree. Which of the following statements is false? a) 18 is in 15's right subtree b) 16 is the left child of 17 c) 8 and 15 are the siblings d) 8 is the parent of 2 In-order traversal of a binary tree can be done iteratively. Given the stack operation sequence as the following: push(1), push(2), push(3), pop(), push(4), pop(), pop(), push(5), pop(), pop(), push(6), pop() Which one of the following statements is TRUE? a) 1 is the parent of 5 b) 6 is the root c) 3 and 5 are siblings d) None of the above Let h be the head of a singly linked list without a dummy head node. To insert a new node t as the first node, we must do: a) h=t; t->next=h->next; b) t->next=h->next; h=t; C) ht; t->next=h; d) t->next=h; h=t