Binary Tree Level Order Traversal

Given a binary tree, return the bottom-up level order traversal of its nodes’ values. (ie, from left to right, level by level from leaf to root).

For example:
Given binary tree [3,9,20,null,null,15,7],

return its bottom-up level order traversal as:

核心问题就是二叉树的层次遍历（借助队列实现），还有两个小问题，一是如何将二叉树的结节按行输出？在二叉树的层次遍历中，我们的通常做法是在一个节点出队前，将它的左右节点入队，我们可以理解为第i层出队后，第i+1层入队，所以我们可以使用一个循环，将第i层输出到一个数组中；第二个问题是要求我们自下向上层输出，这个问题太trivial了，最多用个reverse()就解决了，下面是c++的approach:

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<vector<int>> levelOrderBottom(TreeNode* root) {

        vector<vector<int>> ret;
        if(!root)
            return ret;
        queue<TreeNode*> q;
        q.push(root);

        while(!q.empty()){
            int len = q.size();
            vector<int> temp;
            for(int i = 0; i < len; i++){
                TreeNode* node = q.front();
                q.pop();
                temp.push_back(node->val);
                if(node->left) q.push(node->left);
                if(node->right) q.push(node->right);

            }
            ret.insert(ret.begin(), temp);
        }

        return ret;
    }
};