A. Deleting a node whose location in given B. Searching of an unsorted list for a given item C. Inserting a new node to the front of the list D. Traversing the list in forward direction 9) What is the result of the following string expression 16-) The postfix form of (A+B)(CDE)F/G is 48+6/344+6 C) 8 D) 12 A. AB+CDEFG/ A) 14 B) 6 B. AB+CDEFG/ 10) What is the preorder traversal of the new tree after C. AB+CDEFG/ data 18 is deleted? D. AB+CDEFG/ A) 471024132132 B) 132132241074 17-) Stack is work on the principal of C) 104724132132 D) none of them A. LILO B. FIFO C. ZORO D. LIFO 18-) Under which condition circular queue is Full if cnt is not used 11) Which data structure is needed to convert infix A. Front =1 notation to postfix notation? B. Front =( rear +1)% maxsize C. Front =( front +1)% maxsize A. Branch B. Queue D. Rear =( rear +1)% maxsize C. Tree D. Stack 19-) What is the output of the following code? 12-) Which of the following data structure is linear data structure? int values [5] ={5,3,8,7,11}; stack s; A. Trees B. Graphs initialize (\&s); C. Linked Lists D. None of above for (int i=0;i