algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-12-19 07:17: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/csharp/chapter_tree/binary_tree_bfs.cs
View File

@@ -15,7 +15,7 @@ public class binary_tree_bfs
/* 层序遍历 */
public List<int> levelOrder(TreeNode root)
{
// 初始化队列，加入根结点
// 初始化队列，加入根节点
Queue<TreeNode> queue = new();
queue.Enqueue(root);
// 初始化一个列表，用于保存遍历序列
@@ -23,11 +23,11 @@ public class binary_tree_bfs
while (queue.Count != 0)
{
TreeNode node = queue.Dequeue(); // 队列出队
list.Add(node.val); // 保存结点值
list.Add(node.val); // 保存节点值
if (node.left != null)
queue.Enqueue(node.left); // 左子结点入队
queue.Enqueue(node.left); // 左子节点入队
if (node.right != null)
queue.Enqueue(node.right); // 右子结点入队
queue.Enqueue(node.right); // 右子节点入队
}
return list;
}
@@ -42,6 +42,6 @@ public class binary_tree_bfs
PrintUtil.PrintTree(root);
List<int> list = levelOrder(root);
Console.WriteLine("\n层序遍历的结点打印序列 = " + string.Join(",", list.ToArray()));
Console.WriteLine("\n层序遍历的节点打印序列 = " + string.Join(",", list.ToArray()));
}
}