binary-tree-level-order-traversal

最新推荐文章于 2020-06-18 11:50:43 发布

想吃锅包肉哇

最新推荐文章于 2020-06-18 11:50:43 发布

阅读量290

点赞数

分类专栏： Leetcode 文章标签：树层次遍历队列

本文链接：https://blog.csdn.net/weixin_36909758/article/details/90633603

版权

Leetcode 专栏收录该内容

125 篇文章 0 订阅

订阅专栏

（i）
【题目描述】Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).
For example:
Given binary tree{3,9,20,#,#,15,7},
3
/
9 20
/
15 7
return its level order traversal as:
[
[3],
[9,20],
[15,7]
]

【解题思路】层次遍历的时候需要借助辅助数据结构–队列。

【考查内容】树，层次遍历，队列

/**
 * Definition for binary tree
 * 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>> result;
        if(root ==NULL)
            return result;
        queue<TreeNode *> myque;
        myque.push(root);
        while(!myque.empty()){
            int size = myque.size();
            vector<int> int_vec;
            for(int i=0;i<size;i++){
                TreeNode *temp = myque.front();
                myque.pop();
                int_vec.push_back(temp->val);
                if(temp->left)
                    myque.push(temp->left);
                if(temp->right)
                    myque.push(temp->right);
            }
            result.push_back(int_vec);
        }
        return result;
    }
};

（ii）
【题目描述】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).
For example:
Given binary tree{3,9,20,#,#,15,7},
3
/
9 20
/
15 7
return its bottom-up level order traversal as:
[
[15,7]
[9,20],
[3],
]

【解题思路】将上题结果反过来即可，或使用头插法

/**
 * Definition for binary tree
 * 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 ==NULL)
            return result;
        queue<TreeNode *> myque;
        myque.push(root);
        while(!myque.empty()){
            int size = myque.size();
            vector<int> int_vec;
            for(int i=0;i<size;i++){
                TreeNode *temp = myque.front();
                myque.pop();
                int_vec.push_back(temp->val);
                if(temp->left)
                    myque.push(temp->left);
                if(temp->right)
                    myque.push(temp->right);
            }
            result.push_back(int_vec);
        }
        reverse(result.begin(), result.end());
        return result;
    }
};