mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-26 13:06:28 +08:00
e720aa2d24
* Sync recent changes to the revised Word. * Revised the preface chapter * Revised the introduction chapter * Revised the computation complexity chapter * Revised the chapter data structure * Revised the chapter array and linked list * Revised the chapter stack and queue * Revised the chapter hashing * Revised the chapter tree * Revised the chapter heap * Revised the chapter graph * Revised the chapter searching * Reivised the sorting chapter * Revised the divide and conquer chapter * Revised the chapter backtacking * Revised the DP chapter * Revised the greedy chapter * Revised the appendix chapter * Revised the preface chapter doubly * Revised the figures
43 lines
935 B
C
43 lines
935 B
C
/**
|
|
* File: binary_tree.c
|
|
* Created Time: 2023-01-11
|
|
* Author: Reanon (793584285@qq.com)
|
|
*/
|
|
|
|
#include "../utils/common.h"
|
|
|
|
/* Driver Code */
|
|
int main() {
|
|
/* 初始化二叉树 */
|
|
// 初始化节点
|
|
TreeNode *n1 = newTreeNode(1);
|
|
TreeNode *n2 = newTreeNode(2);
|
|
TreeNode *n3 = newTreeNode(3);
|
|
TreeNode *n4 = newTreeNode(4);
|
|
TreeNode *n5 = newTreeNode(5);
|
|
// 构建节点之间的引用（指针）
|
|
n1->left = n2;
|
|
n1->right = n3;
|
|
n2->left = n4;
|
|
n2->right = n5;
|
|
printf("初始化二叉树\n");
|
|
printTree(n1);
|
|
|
|
/* 插入与删除节点 */
|
|
TreeNode *P = newTreeNode(0);
|
|
// 在 n1 -> n2 中间插入节点 P
|
|
n1->left = P;
|
|
P->left = n2;
|
|
printf("插入节点 P 后\n");
|
|
printTree(n1);
|
|
|
|
// 删除节点 P
|
|
n1->left = n2;
|
|
// 释放内存
|
|
free(P);
|
|
printf("删除节点 P 后\n");
|
|
printTree(n1);
|
|
|
|
freeMemoryTree(n1);
|
|
return 0;
|
|
}
|