CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-02-03 10:53:35 +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/cpp/chapter_tree/binary_tree.cpp
View File

@@ -10,7 +10,7 @@
/* Driver Code */
int main() {
/* 初始化二叉树 */
// 初始化结点
// 初始化节点
TreeNode* n1 = new TreeNode(1);
TreeNode* n2 = new TreeNode(2);
TreeNode* n3 = new TreeNode(3);
@@ -24,17 +24,17 @@ int main() {
cout << endl << "初始化二叉树\n" << endl;
PrintUtil::printTree(n1);
/* 插入与删除结点 */
/* 插入与删除节点 */
TreeNode* P = new TreeNode(0);
// 在 n1 -> n2 中间插入结点 P
// 在 n1 -> n2 中间插入节点 P
n1->left = P;
P->left = n2;
cout << endl << "插入结点 P 后\n" << endl;
cout << endl << "插入节点 P 后\n" << endl;
PrintUtil::printTree(n1);
// 删除结点 P
// 删除节点 P
n1->left = n2;
delete P; // 释放内存
cout << endl << "删除结点 P 后\n" << endl;
cout << endl << "删除节点 P 后\n" << endl;
PrintUtil::printTree(n1);
// 释放内存