New 55% Off on All Courses - Enroll Now! Click Here

    Question

    Consider a Binary Search Tree (BST) with the following

    values inserted in sequence: 45, 32, 50, 15, 40, 47, 60. What will be the in-order traversal of this BST after all insertions?
    A 15, 32, 40, 45, 47, 50, 60 Correct Answer Incorrect Answer
    B 60, 50, 47, 45, 40, 32, 15 Correct Answer Incorrect Answer
    C 45, 32, 15, 40, 50, 47, 60 Correct Answer Incorrect Answer
    D 15, 40, 32, 45, 47, 50, 60 Correct Answer Incorrect Answer
    E 60, 47, 50, 45, 40, 32, 15 Correct Answer Incorrect Answer

    Solution

    In-order traversal of a BST processes nodes in an ascending order because it visits the left subtree first, then the root, and finally the right subtree. After inserting the values in the specified order into the BST, performing an in-order traversal yields the nodes in the correct ascending order: 15, 32, 40, 45, 47, 50, 60. The traversal algorithm guarantees that every node’s left subtree is smaller, and the right subtree is larger, which ensures a sorted sequence. Why other options are wrong: B) This is the reverse order of an in-order traversal, visiting the largest element first. C) This option shows a pre-order traversal, which visits the root node first before the subtrees. D) This sequence incorrectly mixes elements from the left and right subtrees, violating the order property. E) This option represents a reverse post-order traversal, starting with the deepest right-side elements.

    Practice Next

    Relevant for Exams: