[leetcode]107. Binary Tree Level Order Traversal II

[leetcode]107. Binary Tree Level Order Traversal II

---

Analysis

组会又被怼了—— [哎~]

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).
这题是二叉树的一个层序遍历，还是比较简单啦~（虽然因为粗心vector越界了，大概是因为组会被怼了，脑子丢在了老师办公室T.T）
这个博客中详细介绍了二叉树的几种遍历：https://blog.csdn.net/gatieme/article/details/51163010

Implement

/**
 * 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>> res;
        if(root==NULL)
            return res;
        vector<int> res1;
        deque<TreeNode* > q1, q2;
        q1.push_back(root);
        while(q1.empty() != true){
            res1.resize(0);
            while(q1.empty() != true){
                TreeNode* tmp = q1.front();
                q1.pop_front();
                res1.push_back(tmp->val);
                if(tmp->left!=NULL)
                    q2.push_back(tmp->left);
                if(tmp->right!=NULL)
                    q2.push_back(tmp->right);
            }
            res.push_back(res1);
            q1.swap(q2);
        }
        reverse(res.begin(), res.end());
        return res;
    }
};