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

12
codes/java/chapter_tree/binary_tree.java
View File

@@ -11,7 +11,7 @@ import include.*;
public class binary_tree {
public static void main(String[] args) {
/* 初始化二叉树 */
// 初始化结点
// 初始化节点
TreeNode n1 = new TreeNode(1);
TreeNode n2 = new TreeNode(2);
TreeNode n3 = new TreeNode(3);
@@ -25,16 +25,16 @@ public class binary_tree {
System.out.println("\n初始化二叉树\n");
PrintUtil.printTree(n1);
/* 插入与删除结点 */
/* 插入与删除节点 */
TreeNode P = new TreeNode(0);
// 在 n1 -> n2 中间插入结点 P
// 在 n1 -> n2 中间插入节点 P
n1.left = P;
P.left = n2;
System.out.println("\n插入结点 P 后\n");
System.out.println("\n插入节点 P 后\n");
PrintUtil.printTree(n1);
// 删除结点 P
// 删除节点 P
n1.left = n2;
System.out.println("\n删除结点 P 后\n");
System.out.println("\n删除节点 P 后\n");
PrintUtil.printTree(n1);
}
}