LeetCode:Binary Tree Level Order Traversal

最新推荐文章于 2020-11-25 22:56:30 发布

yao_hust_iAC

最新推荐文章于 2020-11-25 22:56:30 发布

阅读量862

点赞数

分类专栏： LeetCode 文章标签： algorithm leetcode

本文链接：https://blog.csdn.net/yao_wust/article/details/41206249

版权

LeetCode 专栏收录该内容

89 篇文章 0 订阅

订阅专栏

题目描述：

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]
]

思路：利用队列层序遍历二叉树。在队列中加入一个flag指针，每次遍历到flag指针时就表示当前这一层遍历结束。

代码：

vector<vector<int> > Solution::levelOrder(TreeNode *root)
{
    vector<vector<int> > result;
    vector<int> sequence;
    TreeNode * flag = new TreeNode(0);
    queue<TreeNode *> treenode_queue;
    if(root == NULL)
        return result;
    treenode_queue.push(root);
    treenode_queue.push(flag);
    while(treenode_queue.size() >= 1)
    {
        TreeNode * node = treenode_queue.front();
        treenode_queue.pop();
        if(node == flag)
        {
            result.push_back(sequence);
            sequence.clear();
            if(treenode_queue.empty())
                break;
            treenode_queue.push(flag);
        }
        else
        {
            sequence.push_back(node->val);
            if(node->left != NULL)
                treenode_queue.push(node->left);
            if(node->right != NULL)
                treenode_queue.push(node->right);
        }
    }
    return result;
}