CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-24 02:21:30 +08:00
Code Issues Packages Projects Releases Wiki Activity

Unify the naming of the C codes.

Browse Source
This commit is contained in:
Yudong Jin
2023-01-12 00:31:11 +08:00
parent 9ef3395aee
commit 40b5be5302
11 changed files with 51 additions and 52 deletions
Download Patch File Download Diff File Expand all files Collapse all files

19
codes/c/chapter_tree/binary_tree.c
View File

@@ -10,34 +10,33 @@
int main() {
/* 初始化二叉树 */
// 初始化结点
TreeNode* n1 = NewTreeNode(1);
TreeNode* n2 = NewTreeNode(2);
TreeNode* n3 = NewTreeNode(3);
TreeNode* n4 = NewTreeNode(4);
TreeNode* n5 = NewTreeNode(5);
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);
printTree(n1);
/* 插入与删除结点 */
TreeNode* P = NewTreeNode(0);
TreeNode* P = newTreeNode(0);
// 在 n1 -> n2 中间插入结点 P
n1->left = P;
P->left = n2;
printf("插入结点 P 后\n");
PrintTree(n1);
printTree(n1);
// 删除结点 P
n1->left = n2;
// 释放内存
free(P);
printf("删除结点 P 后\n");
PrintTree(n1);
printTree(n1);
return 0;
}

6
codes/c/chapter_tree/binary_tree_bfs.c
View File

@@ -52,15 +52,15 @@ int main() {
// 这里借助了一个从数组直接生成二叉树的函数
int nums[] = {1, 2, 3, NIL, 5, 6, NIL};
int size = sizeof(nums) / sizeof(int);
TreeNode *root = ArrayToTree(nums, size);
TreeNode *root = arrToTree(nums, size);
printf("初始化二叉树\n");
PrintTree(root);
printTree(root);
/* 层序遍历 */
// 需要传入数组的长度
int *arr = levelOrder(root, &size);
printf("层序遍历的结点打印序列 = ");
PrintArray(arr, size);
printArray(arr, size);
return 0;
}

12
codes/c/chapter_tree/binary_tree_dfs.c
View File

@@ -43,10 +43,10 @@ int main() {
/* 初始化二叉树 */
// 这里借助了一个从数组直接生成二叉树的函数
int nums[] = {1, 2, 3, 4, 5, 6, 7};
int size = sizeof(nums) / sizt ceof(int);
TreeNode *root = ArrayToTree(nums, size);
int size = sizeof(nums) / sizeof(int);
TreeNode *root = arrToTree(nums, size);
printf("初始化二叉树\n");
PrintTree(root);
printTree(root);
/* 前序遍历 */
// 初始化辅助数组
@@ -54,19 +54,19 @@ int main() {
size = 0;
preOrder(root, &size);
printf("前序遍历的结点打印序列 = ");
PrintArray(arr, size);
printArray(arr, size);
/* 中序遍历 */
size = 0;
inOrder(root, &size);
printf("中序遍历的结点打印序列 = ");
PrintArray(arr, size);
printArray(arr, size);
/* 后序遍历 */
size = 0;
postOrder(root, &size);
printf("后序遍历的结点打印序列 = ");
PrintArray(arr, size);
printArray(arr, size);
return 0;
}