leetcode-107. Binary Tree Level Order Traversal II

解題思路：层序遍历结点的同时，将每层的节点放入栈中。最后将栈中元素依次弹出并返回。

/**
 * 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) {
        if(!root) return vector<vector<int>>();
        stack<vector<int>> sv;
        vector<vector<int>> vvi;
        queue<TreeNode *> qt;
        qt.push(root);
        while(!qt.empty()){
            int size = qt.size();
            vector<int> vi;
            TreeNode *tmp; 
            for(int i=0;i<size;i++){
                tmp = qt.front();
                if(tmp->left)
                    qt.push(tmp->left);
                if(tmp->right)
                    qt.push(tmp->right);
                vi.push_back(tmp->val);    
                qt.pop();
            }
            sv.push(vi);            
        }
        
        while(!sv.empty()){
            vvi.push_back(sv.top());
            sv.pop();
        }
        return vvi;
    }
};