21. Consider the following binary search tree:
If we remove the node, which of the node from the left subtree will be the new root
(1) 11
(2) 12
(3) 13
(4) 16
Answer : 4
22. Consider the following operations performed on a stack of size 5:
Push (a): Pop(); Push(b); Push(c); Pop();
Push(d);Pop();Pop();Push(e)
Which of the following statements is correct?
(1) Underflow occurs
(2) Stack operations are performed smoothly
(3) Overflow occurs
(4) None of the above
Answer : 2
If we remove the node, which of the node from the left subtree will be the new root
(1) 11
(2) 12
(3) 13
(4) 16
Answer : 4
22. Consider the following operations performed on a stack of size 5:
Push (a): Pop(); Push(b); Push(c); Pop();
Push(d);Pop();Pop();Push(e)
Which of the following statements is correct?
(1) Underflow occurs
(2) Stack operations are performed smoothly
(3) Overflow occurs
(4) None of the above
Answer : 2