Multiple choice Which traversal technique lists the notes of a binary search tree in ascending order? Post order In order Pre order None of these Reveal answer Fill a bubble to check yourself B Correct answer Explanation In-order traversal of a binary search tree visits nodes in the order: Left, Root, Right. Because of the BST property, this sequence results in nodes being visited in ascending order.