What is the output of an in-order traversal of the binary tree with root 1, left

What is the output of an in-order traversal of the binary tree with root 1, left child 2, and right child 3?

What is the output of an in-order traversal of the binary tree with root 1, left child 2, and right child 3?

Step 1: Identify the structure of the binary tree. The root is 1, with a left child 2 and a right child 3.
Step 2: Start the in-order traversal. First, go to the left child of the root (which is 2).
Step 3: Since 2 has no left child, we visit 2 and record it.
Step 4: After visiting 2, we go back to the root (which is 1) and visit it next.
Step 5: After visiting 1, we move to the right child of the root (which is 3).
Step 6: Since 3 has no left child, we visit 3 and record it.
Step 7: We have now visited all nodes in the order of left child, parent, right child.

No concepts available.