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

Update README.md

Browse Source
This commit is contained in:
bt3gl 2023-07-29 14:28:02 -07:00 committed by GitHub
parent 1caaed58a1
commit 48720ada4d
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 21 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

22
trees_and_graphs/README.md
View File

@ -1,8 +1,28 @@
## trees ## trees and graphs
<br> <br>
---
### tree tranversals
<br>
* if the depth of the tree is too large, stack overflow might happen, therefore iterative solutions might be better.
* **in-order** are similar to breath-first search (level order problems)
- work with queues
* **pre-order** is top-down (parameters are passed down to children).
- work with stacks
* **post-order** is a bottom-up solution (if you know the answer of the children, can you concatenate the answer of the nodes?):
- deletion process is always post-order: when you delete a node, you will delete its left child and its right child before you delete the node itself.
- also, post-order is used in mathematical expressions as it's easier to write a program to parse a post-order expression. using a stack, each time when you meet a operator, you can just pop 2 elements from the stack, calculate the result and push the result back into the stack.
<br>
---
### `Tree.py` ### `Tree.py`
<br> <br>