New RBI Grade B 2025 Notification will come Soon! Enroll Here

    Question

    In a binary tree, which traversal method visits the root

    node first, then the left subtree, and finally the right subtree?
    A Inorder Traversal Correct Answer Incorrect Answer
    B Preorder Traversal Correct Answer Incorrect Answer
    C Postorder Traversal Correct Answer Incorrect Answer
    D Level-order Traversal Correct Answer Incorrect Answer
    E Depth-first Traversal Correct Answer Incorrect Answer

    Solution

    In Preorder Traversal , the root node is visited first, followed by the left subtree, and then the right subtree. This traversal method is often used for creating a copy of the tree or evaluating prefix expressions. The incorrect options: Inorder Traversal : This method visits the left subtree first, then the root node, and finally the right subtree. Postorder Traversal : In this traversal, the left subtree is visited first, followed by the right subtree, and the root node is visited last. Level-order Traversal : This method visits nodes level by level from top to bottom and left to right. Depth-first Traversal : This is a general term that includes preorder, inorder, and postorder traversal methods, but it does not specify the exact order.

    Practice Next