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

Update README.md

Browse Source
This commit is contained in:
bt3gl 2023-08-08 17:49:23 -07:00 committed by GitHub
parent 86b7f9ce18
commit bc8ff138e3
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
trees/README.md
View File

@ -16,13 +16,13 @@
<br>
* **binary trees** are trees that have each up to 2 children.
* **binary trees** are trees that have up to 2 children.
* access, search, remove, insert are all `O(log(N)`. space complexity of traversing balanced trees is `O(h)` where `h` is the height of the tree (while very skewed trees will be `O(N)`.
* the **width** is the number of nodes in a level.
* the **degree** is the nunber of children of a node.
* the **degree** is the number of children of a node.
* a **complete tree** is a tree on which every level is fully filled (except perhaps for the last).
@ -205,7 +205,7 @@ def bfs_iterative(root):
- in a bst, in-order traversal will be sorted in the ascending order (therefore, it's the most frequently used method).
- converting a sorted array to a bst with inorder has no unique solution (in another hadnd, both preorder and postorder are unique identifiers of a bst).
- converting a sorted array to a bst with inorder has no unique solution (in another hand, both preorder and postorder are unique identifiers of a bst).
<br>