GK Question

technology medium mcq

Which traversal method visits the root node before its subtrees in a binary tree?

  1. Inorder
  2. Preorder
  3. Postorder
  4. 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.

Topic Data Structures
Exam Relevance SSC JE, Banking IT, Railway
More in technology Back to all questions