Suppose that a binary search tree has the following shape.

Place the integers 1 through 10 on the nodes $A$ through $J$ in a manner consistent with the definition of a binary search tree.

$A:$
$B:$
$C:$
$D:$
$E:$
$F:$
$G:$
$H:$
$I:$
$J:$

Think about how you would describe a general procedure for visiting the nodes of a binary search tree in order.