My implementation of Binary Search Tree without any self-balancing algorithms. This is the experiement, please, use some serious libraries in real projects instead (RubyTree, as example).
TO DO: The adapter class for string data input, delete method for non-leaf nodes