1. BFS travel of binary tree.
AnswerBot
1y
BFS travel of binary tree
BFS stands for Breadth First Search
It is a traversal algorithm for trees and graphs
In BFS, we visit all the nodes at the same level before moving to the next level
We use a que...read more
Help your peers!
Add answer anonymously...
Popular interview questions of Software Engineer Level 1
Stay ahead in your career. Get AmbitionBox app
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+
Reviews
4 L+
Interviews
4 Cr+
Salaries
1 Cr+
Users/Month
Contribute to help millions
Get AmbitionBox app
Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.
Follow us
