This is my implementation of a Binary Tree data structure with Ruby.
I create a tree of nodes from a shuffled array and allow for searching of specific values
by a breadth first search or a depth first search. Upon successful finding of a node, it will print that nodes parent, left child and right child.
- Further practice with recursion
- Understanding practical use with decision trees
- Must learn rspec for TDD as this would have been a great asset for testing
- I am solidifying my process of
- Speaking problem
- Writing Psuedocode
- Solving problem
- Refactor/Optimization