Explanation : When we delete root node, tree will be
but this tree is not balance, so we will find inorder predecessor or inorder successor and replace it with root node now. In this problem we will use inorder predecessor-Root node will be 16.
So, option (D) is correct.
Explanation : We can use stack for string reversal, evaluation of postfix expression and most important is implementation of recursion but job scheduling is not done by stack. So, option (C) is correct.