UGC NET COMPUTER SCIENCE SOLVED PAPERS 2014-16 - UGC NET Computer Science Paper 2 JULY 2016

21. Consider the following binary search tree : If we remove the root node, which of the node from the left subtree will be the new root ?

  • Option : D
  • 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.
Cancel reply
Cancel reply

24. Which of the following is not an inherent application of stack?

  • Option : C
  • 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.
Cancel reply
Cancel reply