jesse/dsa-practice
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Add iterative version of binary tree traversal and enum to switch algo

Browse Source
This commit is contained in:
Jesse Millwood
2024-10-30 14:27:57 -04:00
parent 011236f238
commit 65996765d1
3 changed files with 181 additions and 20 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
Readme.org
View File

@@ -60,15 +60,15 @@ To run the tests:
** Stacks and Queues [0/2]
- [ ] Stack Min (CTCI: 3.1)
- [ ] Sort Stack (CTCI: 3.5)
** Trees and Graphs [4/9]
** Trees and Graphs [7/9]
- [X] Implement binary tree object
- Insert breadth first
- [X] Recursive Pre-order traversal
- [X] Recursive In-order traversal
- [X] Recursive Post-order traversal
- [ ] Non-Recursive Pre-order traversal
- [ ] Non-Recursive In-order traversal
- [ ] Non-Recursive Post-order traversal
- [X] Non-Recursive Pre-order traversal
- [X] Non-Recursive In-order traversal
- [X] Non-Recursive Post-order traversal
- [ ] Min Heap
- [ ] Binary Search
** C/C++ [2/5]