xmengnet/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2024-12-25 14:26:29 +08:00
Code Issues Projects Releases Packages Wiki Activity Actions

Compare commits

base: xmengnet:4d20fe7b8c306bab9697964861b736d8dd6073c0
Branches Tags
xmengnet:main
xmengnet:gh-pages
xmengnet:docs
xmengnet:dev
xmengnet:docker-dev
xmengnet:1.2.0
xmengnet:1.1.0
xmengnet:1.0.0
xmengnet:1.0.0b6
xmengnet:1.0.0b5
xmengnet:1.0.0b4
xmengnet:1.0.0b3
xmengnet:1.0.0b2
xmengnet:1.0.0b1
...
compare: xmengnet:58164b22fdd3bf831d655c304217b55536779695
Branches Tags
xmengnet:main
xmengnet:gh-pages
xmengnet:docs
xmengnet:dev
xmengnet:docker-dev
xmengnet:1.2.0
xmengnet:1.1.0
xmengnet:1.0.0
xmengnet:1.0.0b6
xmengnet:1.0.0b5
xmengnet:1.0.0b4
xmengnet:1.0.0b3
xmengnet:1.0.0b2
xmengnet:1.0.0b1

2 commits
4d20fe7b8c ... 58164b22fd

Author SHA1 Message Date
Thomas
58164b22fd
Merge 6f81e17b19 into 894e3d536b 2024-11-24 00:39:52 +08:00
sslmj2020
894e3d536b
Update array_binary_tree.cpp (#1568)
Some checks failed
C++ / build (Release, clang, clang++, ubuntu-latest) (push) Failing after 16s
Details
C++ / build (Release, gcc, g++, ubuntu-latest) (push) Failing after 14s
Details
C++ / build (Release, cl, cl, windows-latest) (push) Has been cancelled
Details 
打印的小错误
 2024-11-24 00:39:33 +08:00
1 changed files with 3 additions and 3 deletions
Show stats Expand all files Collapse all files

6
codes/cpp/chapter_tree/array_binary_tree.cpp
View file

@ -115,9 +115,9 @@ int main() {
int i = 1; int i = 1;
int l = abt.left(i), r = abt.right(i), p = abt.parent(i); int l = abt.left(i), r = abt.right(i), p = abt.parent(i);
cout << "\n当前节点的索引为 " << i << "，值为 " << abt.val(i) << "\n"; cout << "\n当前节点的索引为 " << i << "，值为 " << abt.val(i) << "\n";
cout << "其左子节点的索引为 " << l << "，值为 " << (l != INT_MAX ? to_string(abt.val(l)) : "nullptr") << "\n"; cout << "其左子节点的索引为 " << l << "，值为 " << (abt.val(l) != INT_MAX ? to_string(abt.val(l)) : "nullptr") << "\n";
cout << "其右子节点的索引为 " << r << "，值为 " << (r != INT_MAX ? to_string(abt.val(r)) : "nullptr") << "\n"; cout << "其右子节点的索引为 " << r << "，值为 " << (abt.val(r) != INT_MAX ? to_string(abt.val(r)) : "nullptr") << "\n";
cout << "其父节点的索引为 " << p << "，值为 " << (p != INT_MAX ? to_string(abt.val(p)) : "nullptr") << "\n"; cout << "其父节点的索引为 " << p << "，值为 " << (abt.val(p) != INT_MAX ? to_string(abt.val(p)) : "nullptr") << "\n";
// 遍历树 // 遍历树
vector<int> res = abt.levelOrder(); vector<int> res = abt.levelOrder();