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

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_dfs.dart
View File

@@ -13,7 +13,7 @@ List<int> list = [];
/* 前序遍历 */
void preOrder(TreeNode? node) {
if (node == null) return;
// 访问优先级：根节点 -> 左子树 -> 右子树
// 访问优先级：根结点 -> 左子树 -> 右子树
list.add(node.val);
preOrder(node.left);
preOrder(node.right);
@@ -22,7 +22,7 @@ void preOrder(TreeNode? node) {
/* 中序遍历 */
void inOrder(TreeNode? node) {
if (node == null) return;
// 访问优先级：左子树 -> 根节点 -> 右子树
// 访问优先级：左子树 -> 根结点 -> 右子树
inOrder(node.left);
list.add(node.val);
inOrder(node.right);
@@ -31,7 +31,7 @@ void inOrder(TreeNode? node) {
/* 后序遍历 */
void postOrder(TreeNode? node) {
if (node == null) return;
// 访问优先级：左子树 -> 右子树 -> 根节点
// 访问优先级：左子树 -> 右子树 -> 根结点
postOrder(node.left);
postOrder(node.right);
list.add(node.val);