Daily Archives: January 7, 2008

Build a Binary Tree in Ruby

Posted on January 7, 2008 by proj

Building algorithms in ruby is fun and rewarding. This binary tree doesn’t balance itself but it is simple and flexible using ruby blocks for visit and insert. Traversal style can be selected optionally to visit with :inorder, :preorder or :postorder. … Continue reading →

Posted in algorithms, ruby | 2 Comments