Dominic Myers
Now for my notes on Binary Search Trees (the sequel of Data Structures in JS: Linked Lists):
- Recursion - part 1 https://jsfiddle.net/annoyingmouse/Lp02ams1/
- Recursion part 2 and the Call Stack https://jsfiddle.net/annoyingmouse/jyk5rcfp/
- Insert Method https://jsfiddle.net/annoyingmouse/9cq14ftw/
- Testing Insert https://jsfiddle.net/annoyingmouse/0w53az1L/
- Contains Method https://jsfiddle.net/annoyingmouse/5objf4uk/
- Testing Contains https://jsfiddle.net/annoyingmouse/w7vr5qLf/
- Depth First Traversal - In-Order https://jsfiddle.net/annoyingmouse/zwg3be9u/
- Testing Depth First Traversal In-Order https://jsfiddle.net/annoyingmouse/1rqnwb5y/
- Depth First Traversal - Pre-Order https://jsfiddle.net/annoyingmouse/qojt4v3p/
- Testing Depth First Traversal Pre-Order https://jsfiddle.net/annoyingmouse/aj71pfz0/
- Depth First Traversal - Post-Order https://jsfiddle.net/annoyingmouse/k7bmphqw/
- Breadth First Traversal - part 1 https://jsfiddle.net/annoyingmouse/qy8L2x40/
- Breadth First Traversal - part 2 https://jsfiddle.net/annoyingmouse/d2ec73L5/
- Testing Breadth First Traversal https://jsfiddle.net/annoyingmouse/kj78xf5w/
- Binary Search Tree - Independent Exercise https://jsfiddle.net/annoyingmouse/muzp0b7d/
- Binary Search Tree - Exercise Review https://jsfiddle.net/annoyingmouse/0gnjs9zL/
Again, lots of fun! Intrigued that my min and max functions were different, knew I should've used recursion!
