Which of the following is true about a binary search tree (BST)?

Practice Questions

1 question
Q1
Which of the following is true about a binary search tree (BST)?
  1. Inorder traversal gives sorted order
  2. Preorder traversal gives sorted order
  3. Postorder traversal gives sorted order
  4. Level order traversal gives sorted order

Questions & Step-by-step Solutions

1 item
Q
Q: Which of the following is true about a binary search tree (BST)?
Solution: In a binary search tree, an inorder traversal visits nodes in non-decreasing order, thus giving a sorted order.
Steps: 0

Related Questions

Soulshift Feedback ×

On a scale of 0–10, how likely are you to recommend The Soulshift Academy?

Not likely Very likely