LeetCode - 107. 二叉树的层次遍历 II

107. 二叉树的层次遍历 II

给定一个二叉树，返回其节点值自底向上的层次遍历。 （即按从叶子节点所在层到根节点所在的层，逐层从左向右遍历）

例如：
给定二叉树 [3,9,20,null,null,15,7],

/**
 * 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>> res;
       queue<TreeNode*> q{{root}};
       while (!q.empty()) {
           vector<int> tmp;
           for (int i = q.size(); i > 0; --i) {
               TreeNode *t = q.front(); q.pop();
               tmp.push_back(t->val);
               if (t->left) q.push(t->left);
               if (t->right) q.push(t->right);
           }
           res.push_back(tmp);
       }
       int k = 0, r = res.size() - 1;
       while (k < r) {
           swap(res[k++], res[r--]);
       }
       return res;
    }
};