107. 二叉树的层次遍历 II

链接：https://leetcode-cn.com/problems/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) {
             vector<vector<int>> result;
             if(!root) {
                 return std::move(result);
             }
             queue<TreeNode*> que;
             que.push(root);
             while(!que.empty()) {
                 queue<TreeNode*> tmp_que;
                 vector<int> tmp_vec;
                 while(!que.empty()) {
                     TreeNode* node = que.front();
                     que.pop();
                     tmp_vec.push_back(node->val);
                     if(node->left) {
                         tmp_que.push(node->left);
                         //tmp_vec.push_back(node->left->val);
                     }
                     if(node->right) {
                         tmp_que.push(node->right);
                         //tmp_vec.push_back(node->right->val);
                     }
                 }
                 que = std::move(tmp_que);
                 result.push_back(std::move(tmp_vec));
                 //vec = std::move(tmp_vec);
             }
             reverse(result.begin(), result.end());
             return std::move(result);
        }
};