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

Bug fixes to C code.

Browse Source
This commit is contained in:
krahets
2023-11-01 05:14:22 +08:00
parent f7dd05e7a4
commit 355cc3a6b1
31 changed files with 246 additions and 219 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
codes/c/chapter_tree/array_binary_tree.c
View File

@@ -13,7 +13,7 @@ typedef struct {
} ArrayBinaryTree;
/* 构造函数 */
ArrayBinaryTree *createArrayBinaryTree(int *arr, int arrSize) {
ArrayBinaryTree *newArrayBinaryTree(int *arr, int arrSize) {
ArrayBinaryTree *abt = (ArrayBinaryTree *)malloc(sizeof(ArrayBinaryTree));
abt->tree = malloc(sizeof(int) * arrSize);
memcpy(abt->tree, arr, sizeof(int) * arrSize);
@@ -21,6 +21,12 @@ ArrayBinaryTree *createArrayBinaryTree(int *arr, int arrSize) {
return abt;
}
/* 析构函数 */
void delArrayBinaryTree(ArrayBinaryTree *abt) {
free(abt->tree);
free(abt);
}
/* 节点数量 */
int size(ArrayBinaryTree *abt) {
return abt->size;
@@ -120,7 +126,7 @@ int main() {
printf("二叉树的链表表示：\n");
printTree(root);
ArrayBinaryTree *abt = createArrayBinaryTree(arr, arrSize);
ArrayBinaryTree *abt = newArrayBinaryTree(arr, arrSize);
// 访问节点
int i = 1;
@@ -155,8 +161,6 @@ int main() {
free(res);
// 释放内存
freeMemoryTree(root);
free(abt);
delArrayBinaryTree(abt);
return 0;
}