huy/tetulia — pull request #4 by thejavadev (2012-09-30 23:01:58+00:00)
Title: Faster algorithm using memory?

With these algorithm you don't need to calculate the deep. Is O(n) and the worse case is the deep of the tree.