Which one of the following statements is TRUE?

By definition of a Binary Search Tree (BST), for every node $u$, all keys in its left subtree are strictly smaller than the key at $u$, and all keys in its right subtree are strictly greater than the key at $u$.

An inorder traversal (Left $\to$ Root $\to$ Right) visits the nodes in strictly non-decreasing (ascending) order. Since the set $V$ contains distinct integers, the inorder traversal of any BST constructed from $V$ is always the unique sequence of elements of $V$ sorted in ascending order, regardless of the order in which the elements were inserted.

In contrast:

• The root node is the very first inserted element, which depends on the insertion sequence.

• The preorder and postorder traversals depend directly on the structural shape of $T$, which also depends on the insertion sequence.

Therefore, only the inorder traversal of $T$ can be uniquely determined from the set $V$ alone.

Hence, (A) is the correct statement.