Which traversal method visits the root node before its subtrees in a binary tree?
- Inorder
- Preorder
- Postorder
- Level-order
Answer: Preorder
Preorder traversal: Root → Left Subtree → Right Subtree. Inorder: Left → Root → Right (gives sorted order for BST). Postorder: Left → Right → Root. Level-order uses queue for breadth-first traversal. Tree traversals are frequently tested in SSC JE and programming exams.