Inorder traversal of a Binary Search Tree gives the keys in:
Show answerHide answer
Correct answer: (C) Ascending (sorted) order
Explanation
Left, root, right visits BST keys in sorted order.
Correct answer: (C) Ascending (sorted) order
Explanation
Left, root, right visits BST keys in sorted order.
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.