Git-Mirrors/master-algorithms-py
1
0
Fork 0
mirror of https://github.com/autistic-symposium/master-algorithms-py.git synced 2025-04-29 20:26:07 -04:00
Code Issues Packages Projects Releases Wiki Activity

Update README.md

Browse Source
This commit is contained in:
marina 2023-08-03 16:02:59 -07:00 committed by GitHub
parent 50c188a88c
commit 072febeb9c
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 2 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
trees/README.md
View File

@ -383,7 +383,8 @@ def dfs(root, visited):
<br>
- `left -> node -> right`
- in a bst, in-order traversal will be in ascending order (therefore, it's the most frequently used method).
- in a bst, in-order traversal will be sorted in the ascending order (therefore, it's the most frequently used method).
- note, however, that convert a sorted array to a bst with inorder has no unique solution (at the same time, both preorder and postorder are unique identifiers of a bst).
```python
def inorder(self, root):