Binary Tree Level Order Traversal

最新推荐文章于 2022-02-20 23:20:19 发布

weixin_30242907

最新推荐文章于 2022-02-20 23:20:19 发布

阅读量39

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/pengyu2003/p/3606338.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]
]
用lev记录当前树到了第几层。

/**
 * 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> > re;
    vector<vector<int> > levelOrder(TreeNode *root) {
        if(root == NULL)return re;
        level(root,1);
        return re;
    }
    void level(TreeNode *root, int lev)
    {
        if(root == NULL)return;
        if(lev > re.size())
        {
            vector<int > temp;
            re.push_back(temp);
        }
        re[lev-1].push_back(root->val);
        level(root->left,lev+1);
        level(root->right,lev+1);
    }
};

转载于:https://www.cnblogs.com/pengyu2003/p/3606338.html