Binary search tree implemented in Ruby
Has the following functionality:
Builds the tree by adding nodes
Returns the node in the tree with the minimum value
Returns the amount of nodes in the tree
Returns an array of the values of all the nodes in the tree
Sums the values of all the nodes in the tree
Returns true or false depending on whether the given node is present in the tree
Returns the node searched for if present
Deletes the given node if present
Don't forget to rspec!