Question:

Breadth first search is equivalent to traversal of binary tree

Show Hint

Level order traversal = BFS. Use a queue to process nodes by level.
Updated On: June 02, 2025
  • Preorder
  • Post order
  • Inorder
  • Level order
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is D

Solution and Explanation

Breadth First Search (BFS) visits nodes level-by-level from the root. In binary trees, this is known as level order traversal.
Was this answer helpful?
0
0

TS PGECET Notification