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

build

Browse Source
This commit is contained in:
krahets
2024-05-07 16:35:22 +08:00
parent 5c7d2c7f17
commit bd54cd096b
6 changed files with 26 additions and 26 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
en/docs/chapter_tree/array_representation_of_tree.md
View File

@@ -155,7 +155,7 @@ This means that when using an array to represent a complete binary tree, it's po
The following code implements a binary tree based on array representation, including the following operations:
- Given a node, obtain its value, left (right) child node, and parent node.
- Obtain the preorder, inorder, postorder, and level-order traversal sequences.
- Obtain the pre-order, in-order, post-order, and level-order traversal sequences.
=== "Python"