Leetcode Binary Tree Level Order Traversal

最新推荐文章于 2021-11-17 20:57:12 发布

weixin_30425949

最新推荐文章于 2021-11-17 20:57:12 发布

阅读量51

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/xiongqiangcs/p/3803888.html

本文介绍了如何使用队列实现二叉树的层次遍历，给出了一段代码示例，并解释了二叉树层次遍历的基本概念。

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

confused what "{1,#,2,3}" means? > read more on how binary tree is serialized on OJ.

层次遍历利用队列实现即可

vector<vector<int> > levelOrder(TreeNode *root){
    vector<vector<int> > result;
    if(root == NULL) return result;
    queue<TreeNode *> que;
    que.push(root);
    int cnt = 1;
    while(!que.empty()){
        vector<int> row;
        int newCnt = 0;
        while(cnt--){
            TreeNode *node = que.front();que.pop();
            row.push_back(node->val);
            if(node->left) {que.push(node->left); newCnt++;}
            if(node->right) {que.push(node->right); newCnt++;}
        }
        cnt = newCnt;
        result.push_back(row);
    }
    return result;
}