LeetCode Binary Tree Level Order Travesal

最新推荐文章于 2024-02-12 01:19:39 发布

Kayser_mhy

最新推荐文章于 2024-02-12 01:19:39 发布

阅读量387

点赞数

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

本文链接：https://blog.csdn.net/u014772182/article/details/41355365

版权

LeetCode 专栏收录该内容

6 篇文章 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]
]

代码如下：

<span style="font-size:14px;">/**
 * 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) return result;
        queue<TreeNode*> temp;
        temp.push(root);
        while (!temp.empty()) {
            queue<TreeNode*> q;
            vector<int> v;
            while (!temp.empty()) {
                TreeNode *t = temp.front();
                v.push_back(t->val);
                if(t->left) q.push(t->left);
                if(t->right) q.push(t->right);
                temp.pop();
            }
            result.push_back(v);
            temp = q;
        }
        return result;
    }
};</span>

NOTE：要判断root为空的情况，否则会出现runtime error！