Question 148

Inorder traversal of a Binary Search Tree gives the keys in:

  1. ADescending order
  2. BLevel order
  3. CAscending (sorted) order
  4. DRandom order
Show answerHide answer

Correct answer: (C) Ascending (sorted) order

Explanation

Left, root, right visits BST keys in sorted order.

From DSSSB TGT Computer Science Full Mock Test 1

This is question 148 of DSSSB TGT Computer Science Full Mock Test 1. 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.