leetCode #107 Binary Tree Level Order Traversal II

最新推荐文章于 2022-07-12 12:28:09 发布

MarStarck

最新推荐文章于 2022-07-12 12:28:09 发布

阅读量350

点赞数

分类专栏： leetCode

本文链接：https://blog.csdn.net/MarStarck/article/details/47613021

版权

leetCode 专栏收录该内容

75 篇文章 0 订阅

订阅专栏

题目：遍历二叉树，从下到上，从左到右

分析：这个跟之前的从上到下，从左到右的层序遍历是姊妹篇。

答案：

先回顾一下原先的层序遍历（把下层节点弄到队列里保存起来）

/**
 * 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>> levelOrder(TreeNode* root) {
        vector<vector<int>> res;
        queue<TreeNode*> thisq;
        if (!root)
            return res;
        thisq.push(root);
        do{
            vector<int> thisline;
            queue<TreeNode*> nextq;
            while(!thisq.empty()){
                thisline.push_back(thisq.front()->val);
                if (thisq.front()->left)
                    nextq.push(thisq.front()->left);
                if (thisq.front()->right)
                    nextq.push(thisq.front()->right);
                thisq.pop();
            }
            res.push_back(thisline);
            thisq = nextq;
        }while(!thisq.empty());
        return res;
    }
};

然后把vector反转一下：

/**
 * 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;
        vector<vector<int>> res_inv;
        queue<TreeNode*> thisq;
        if (!root)
            return res;
        thisq.push(root);
        do{
            vector<int> thisline;
            queue<TreeNode*> nextq;
            while(!thisq.empty()){
                thisline.push_back(thisq.front()->val);
                if (thisq.front()->left)
                    nextq.push(thisq.front()->left);
                if (thisq.front()->right)
                    nextq.push(thisq.front()->right);
                thisq.pop();
            }
            res.push_back(thisline);
            thisq = nextq;
        }while(!thisq.empty());
        
        for (int i = 0; i< res.size(); i++){
            res_inv.push_back(res[res.size() - i - 1]);
        }
        return res_inv;
    }
};

runtime: 16ms;