Reading a binary search tree from left to right gives the elements in:

Question

Accepted Answer

B. Sorted order

1. The search property puts smaller values first.
2. An in order walk visits them in that sequence.
3. So they come out in sorted order.
_Source: OpenStax Introduction to Computer Science, Chapter 3, Data Structures and Algorithms._

Answer

Insertion order

Answer

Random order

Answer

Reverse order

Reading a binary search tree from left to right gives the elements in:

Keep practising Data Structures and Algorithms