Level order traversal of a rooted tree can be done by starting from the root…

PYQ GATE 2004

Level order traversal of a rooted tree can be done by starting from the root and performing

  1. A.

    preorder traversal

  2. B.

    inorder traversal

  3. C.

    depth first search

  4. D.

    breadth first search

Attempted by 1468 students.

Sign up free to check your answer

Sign up free

Explore the full course: Data Structures

Loading lesson…