CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-05-02 23:59:54 +08:00
Code Issues Packages Projects Releases Wiki Activity

refactor: Replace 结点 with 节点 (#452)

Browse Source 
* Replace 结点 with 节点
Update the footnotes in the figures

* Update mindmap

* Reduce the size of the mindmap.png
This commit is contained in:
Yudong Jin
2023-04-09 04:32:17 +08:00
committed by GitHub
parent 3f4e32b2b0
commit 1c8b7ef559
395 changed files with 2056 additions and 2056 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -10,16 +10,16 @@ import '../utils/tree_node.dart';
/* 层序遍历 */
List<int> levelOrder(TreeNode? root) {
// 初始化队列，加入根结点
// 初始化队列，加入根节点
Queue<TreeNode?> queue = Queue();
queue.add(root);
// 初始化一个列表，用于保存遍历序列
List<int> res = [];
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); // 右子结点入队
res.add(node!.val); // 保存节点值
if (node.left != null) queue.add(node.left); // 左子节点入队
if (node.right != null) queue.add(node.right); // 右子节点入队
}
return res;
}
@@ -34,5 +34,5 @@ void main() {
// 层序遍历
List<int> res = levelOrder(root);
print("\n层序遍历的结点打印序列 = $res");
print("\n层序遍历的节点打印序列 = $res");
}