📢 Too many exams? Don’t know which one suits you best? Book Your Free Expert 👉 call Now!

    Question

    Which traversal method for a binary tree processes the

    root node *after* visiting both its left and right subtrees?
    A In-order traversal Correct Answer Incorrect Answer
    B Pre-order traversal Correct Answer Incorrect Answer
    C Post-order traversal Correct Answer Incorrect Answer
    D Level-order traversal Correct Answer Incorrect Answer
    E Depth-first traversal Correct Answer Incorrect Answer

    Solution

    In post-order traversal, the left subtree is visited, then the right subtree, and finally the root node.

    Practice Next
    More IT Operating System Questions
    ask-question