Binary tree traversal order

Which traversal of a binary search tree visits the keys in ascending sorted order?

Show hints (2)+
  1. In a BST, left < node < right.
  2. Visit the smaller side before the node.

Answer

Reveal answer →

In-order (left, node, right)

Want the full step-by-step worked solution? It's part of Premium — along with a worked solution for every question in the bank.

Asked at: Jane Street, IMC

Related questions