Which of the following represents the correct order of visiting nodes during…
2025
Which of the following represents the correct order of visiting nodes during an inorder traversal of a binary tree?
Answer: C. Visit left subtree, then root, then right subtree — Inorder traversal visits nodes in the order: Left Subtree, Root, Right Subtree.
- A.
Visit root, then right subtree, then left subtree
- B.
Visit right subtree, then root, then left subtree
- C.
Visit left subtree, then root, then right subtree
- D.
Visit root, then left subtree, then right subtree
Attempted by 471 students.
Show answer & explanation
Correct answer: C
Inorder traversal visits nodes in the order: Left Subtree, Root, Right Subtree.
Loading lesson…