Discussion
Which traversal of a binary search tree gives elements in sorted order?
Answer: C
The traversal is inorder.
In a BST every key in the left subtree is smaller than the node and every key in the right subtree is larger. Inorder traversal visits left subtree, node, right subtree, so it lists the keys in ascending order.
Preorder visits the node before its subtrees and postorder after them, so neither gives sorted output. Level order lists the tree level by level from the root, which is not sorted either.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development