二叉树的层序遍历

最新推荐文章于 2022-06-29 18:15:28 发布

卧龙_byr

最新推荐文章于 2022-06-29 18:15:28 发布

阅读量644

点赞数

文章标签： Binary Tree Level Or

本文链接：https://blog.csdn.net/wolongdede/article/details/44778341

版权

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},

return its level order traversal as:

[
  [3],
  [9,20],
  [15,7]
]

实现代码：

class Solution {
public:
    vector<vector<int> > levelOrder(TreeNode *root) {
        vector<vector<int> > res;
        if(root==NULL) return res;
        queue<TreeNode *> temp;
        temp.push(root);
        while(!temp.empty())
        {
            vector<int> curlevel;
            queue<TreeNode *> nextlevel;
            while(!temp.empty())
            {
                TreeNode* node = temp.front();  
                temp.pop();  
            
                curlevel.push_back(node->val);
                if (node->left != NULL)  nextlevel.push(node->left);
                if (node->right != NULL) nextlevel.push(node->right);
            }
            res.push_back(curlevel);
            temp = nextlevel;
        }
        return res;
    }
};

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},

return its bottom-up level order traversal as:

[
  [15,7],
  [9,20],
  [3]
]

实现代码：

class Solution {
public:
    vector<vector<int> > levelOrderBottom(TreeNode *root) {
        vector<vector<int> > res;
        if(root==NULL) return res;
        queue<TreeNode *> temp;
        temp.push(root);
        while(!temp.empty())
        {
            vector<int> curlevel;
            queue<TreeNode *> nextlevel;
            while(!temp.empty())
            {
                TreeNode* node = temp.front();  
                temp.pop();  
            
                curlevel.push_back(node->val);
                if (node->left != NULL)  nextlevel.push(node->left);
                if (node->right != NULL) nextlevel.push(node->right);
            }
            res.insert(res.begin(),curlevel);
            temp = nextlevel;
        }
        return res;
    }
};