Consider the following tree traversals on a full binary tree: (i) Preorder…

PYQ GATE 2024

Consider the following tree traversals on a full binary tree:

        (i) Preorder

        (ii) Inorder

        (iii) Postorder

Which of the following traversal options is/are sufficient to uniquely reconstruct the full binary tree?

  1. A.

    (i) and (ii)

  2. B.

    (ii) and (iii)

  3. C.

    (i) and (iii)

  4. D.

    (ii) only

Attempted by 502 students.

Sign up free to check your answer

Sign up free

Explore the full course: Data Structures

Loading lesson…