UTpaper

Free mock tests & test series

Question 65Asked in DSSSB TGT Computer Science (Technical), 7 Aug 2021, Shift 3

Which traversal of binary search tree is in ascending order?

Which traversal of binary search tree is in ascending order? I. Preorder traversal II. Postorder traversal III. Inorder traversal
  1. AOnly II
  2. BI and III
  3. COnly III
  4. DII and III
Show answerHide answer

Correct answer: (C) Only III

Explanation

An in-order traversal (Left, Node, Right) of a BST visits the keys in ascending order. Pre-order and post-order do not.

From DSSSB TGT Computer Science PYQ (Technical), 7 Aug 2021, Shift 3

This is question 65 of DSSSB TGT Computer Science PYQ (Technical), 7 Aug 2021, Shift 3. See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.