Binary Tree Level Order Traversal: How do you traverse a tree level-by-level (BFS)?

Binary Tree Level Order Traversal: How do you traverse a tree level-by-level (BFS)?

题目类型: 技术面试题

这是一道技术面试题，常见于澳洲IT公司面试中。

难度: hard

标签: interviewbit, python, topic-specific

参考答案摘要

You use a queue, start by putting the root in it, then pop one node at a time and add its children, this goes level by level, this is used in many tree problems like shortest path and views. from coll...

本题提供 STAR 原则详细解答和技术解析，登录匠人学院学习中心即可查看完整答案。