adds delete, search (bsf, dsf), max and min to binary search tree.
Adds example about binary search tree, not written by me.
Makes a heap tree out of a binary search tree.
Calculates nearest, traverse_preorder, etc, to binary search tree data structure.
Adds ts.rb who compares different strategies for traversing a tree.