Couple more binary tree solutions.

The level order traversal 2 was actually quite fun. Instead of simply reversing the container which one could do (return a vector<vector<int>> in the top down order, then init a new one from rbegin(), rend()) I've decided instead to use an interesting stack and queue combination to achieve the bottom up result instead.