algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-02 12:58:42 +08:00
Code Issues Packages Projects Releases Wiki Activity

fine tune

Browse Source
This commit is contained in:
krahets
2023-09-17 01:13:15 +08:00
parent b2246e11a7
commit 9f59c572b5
32 changed files with 44 additions and 44 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -134,10 +134,10 @@ int main() {
// 访问节点
int i = 1;
int l = left(i), r = right(i), p = parent(i);
printf("\n当前节点的索引为 %d，值为 %d\n", i, val(abt, i));
printf("其左子节点的索引为 %d，值为 %d\r\n", l, val(abt, l));
printf("其右子节点的索引为 %d，值为 %d\r\n", r, val(abt, r));
printf("其父节点的索引为 %d，值为 %d\r\n", p, val(abt, p));
printf("\n当前节点的索引为 %d ，值为 %d\n", i, val(abt, i));
printf("其左子节点的索引为 %d ，值为 %d\r\n", l, val(abt, l));
printf("其右子节点的索引为 %d ，值为 %d\r\n", r, val(abt, r));
printf("其父节点的索引为 %d ，值为 %d\r\n", p, val(abt, p));
// 遍历树
vector *res = levelOrder(abt);