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

Format C++ codes in Clang-Format Style: Microsoft

Browse Source
This commit is contained in:
krahets
2023-04-14 03:44:02 +08:00
parent f8513455b5
commit 9c9c8b7574
46 changed files with 732 additions and 888 deletions
Download Patch File Download Diff File Expand all files Collapse all files

21
codes/cpp/chapter_tree/binary_tree.cpp
View File

@@ -6,36 +6,35 @@
#include "../include/include.hpp"
/* Driver Code */
int main() {
/* 初始化二叉树 */
// 初始化节点
TreeNode* n1 = new TreeNode(1);
TreeNode* n2 = new TreeNode(2);
TreeNode* n3 = new TreeNode(3);
TreeNode* n4 = new TreeNode(4);
TreeNode* n5 = new TreeNode(5);
TreeNode *n1 = new TreeNode(1);
TreeNode *n2 = new TreeNode(2);
TreeNode *n3 = new TreeNode(3);
TreeNode *n4 = new TreeNode(4);
TreeNode *n5 = new TreeNode(5);
// 构建引用指向（即指针）
n1->left = n2;
n1->right = n3;
n2->left = n4;
n2->right = n5;
cout << endl << "初始化二叉树\n" << endl;
PrintUtil::printTree(n1);
printTree(n1);
/* 插入与删除节点 */
TreeNode* P = new TreeNode(0);
TreeNode *P = new TreeNode(0);
// 在 n1 -> n2 中间插入节点 P
n1->left = P;
P->left = n2;
cout << endl << "插入节点 P 后\n" << endl;
PrintUtil::printTree(n1);
printTree(n1);
// 删除节点 P
n1->left = n2;
delete P; // 释放内存
delete P; // 释放内存
cout << endl << "删除节点 P 后\n" << endl;
PrintUtil::printTree(n1);
printTree(n1);
// 释放内存
freeMemoryTree(n1);