Question: In a binary tree, what is the in-order traversal of the tree with nodes 1, 2, 3?
Options:
Correct Answer: [2, 1, 3]
Solution:
In-order traversal visits the left subtree, then the root, and then the right subtree. For a tree with nodes 1, 2, 3, the in-order traversal is [2, 1, 3].