Binary Tree Level Order Traversal II

不多说，广搜，最后把结果反转一下就OK。

/**
 * Definition for binary tree
 * 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) {
        deque<TreeNode *> d;
        vector<vector<int>> res;
        if (root == NULL)
            return res;
        d.push_back(root);
        d.push_back(NULL);
        while (!d.empty()) {
            vector<int> tmp;
            while (d.front() != NULL) {
                TreeNode *t = d.front();
                d.pop_front();
                tmp.push_back(t->val);
                if (t->left != NULL)
                    d.push_back(t->left);
                if (t->right != NULL)
                    d.push_back(t->right);
            }
            res.push_back(tmp);
            if (d.size() != 1)
                d.push_back(NULL);
            d.pop_front();
        }
        reverse(res.begin(), res.end());
        return res;
    }
};

http://oj.leetcode.com/problems/binary-tree-level-order-traversal-ii/