algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-12-16 03:59:18 +08:00
Code Issues Packages Projects Releases Wiki Activity

Polish the chapter of graph, hashing, appendix

Browse Source
This commit is contained in:
krahets
2023-04-09 03:09:06 +08:00
parent 56243ccc5b
commit 3f4e32b2b0
16 changed files with 151 additions and 151 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
codes/dart/chapter_tree/binary_tree_bfs.dart
View File

@@ -10,7 +10,7 @@ import '../utils/tree_node.dart';
/* 层序遍历 */
List<int> levelOrder(TreeNode? root) {
// 初始化队列，加入根节点
// 初始化队列，加入根结点
Queue<TreeNode?> queue = Queue();
queue.add(root);
// 初始化一个列表，用于保存遍历序列
@@ -18,8 +18,8 @@ List<int> levelOrder(TreeNode? root) {
while (queue.isNotEmpty) {
TreeNode? node = queue.removeFirst(); // 队列出队
res.add(node!.val); // 保存结点值
if (node.left != null) queue.add(node.left); // 左子节点入队
if (node.right != null) queue.add(node.right); // 右子节点入队
if (node.left != null) queue.add(node.left); // 左子结点入队
if (node.right != null) queue.add(node.right); // 右子结点入队
}
return res;
}