Question $5$

$1pts$

How does the structure of a Binary Search Tree $($BST$)$ affect its in$-$order traversal?

The in$-$order traversal of a BST produces a sorted sequence of values.

The in$-$order traversal results in the same sequence as post$-$order traversal in BSTs$.$

The in$-$order traversal always visits the nodes in numerical order, regardless of their arrangement.

The in$-$order traversal is not possible in BSTs due to their hierarchical structure.