LeetCode --- 102. Binary Tree Level Order Traversal

最新推荐文章于 2020-11-25 22:05:52 发布

MissXy_

最新推荐文章于 2020-11-25 22:05:52 发布

阅读量293

点赞数

本文链接：https://blog.csdn.net/MissXy_/article/details/89600070

版权

LeetCode 专栏收录该内容

55 篇文章 0 订阅

订阅专栏

102. Binary Tree Level Order Traversal

Difficulty: Medium

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,null,null,15,7],

return its level order traversal as:

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

Solution

思路

使用queue保存该行节点，如果q不为空，循环；第二个while循环取出当前q的值。OK
Language: C++

/**
 * Definition for a binary tree node.
 * 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) {
        if(!root)   return vv;
        queue<TreeNode* > q;
        q.push(root);
        TreeNode* temp;
        while(!q.empty()){
            int size = q.size();
            while (size--){
                temp = q.front();
                q.pop();
                row.push_back(temp->val);
                if (temp->left)
                    q.push(temp->left);
                if (temp->right)
                    q.push(temp->right);
            }
            vv.push_back(row);
            row.clear();
        }
        return vv;
    }
private:
    vector<int> row;
    vector<vector<int>> vv;
};