First version of the Climbing stairs problem.

Note that in general, memorization should take as smaller size as possible. But also think about scenarios where we need to record all intermediate results.
First version of the Binary tree inorder traversal problem.