zoukankan      html  css  js  c++  java
  • Binary Tree Level Order Traversal

    给定一个二叉树,返回其按层次遍历的节点值。 (即逐层地,从左到右访问所有节点)。

    例如:
    给定二叉树: [3,9,20,null,null,15,7],

        3
       / 
      9  20
        /  
       15   7
    

    返回其层次遍历结果:

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

    1、递归版
    /**
     * 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) {
            
            vector<vector<int>> result;
            levelorder(root, 0, result);
            return result;
        }
        void levelorder(TreeNode* root, int level, vector<vector<int>>& result)
        {
            
            if (!root)
                return;
            
            if(level == result.size())
                result.push_back({});
            result[level].push_back(root->val);
            if(root->left)levelorder(root->left, level+1, result);
            if(root->right)levelorder(root->right, level+1, result);
        }
    };
    2、迭代版
    /**
     * 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) {
            
        vector<vector<int> > res;
            if (root == NULL) return res;
    
            queue<TreeNode*> q;
            q.push(root);
            while (!q.empty()) {
                vector<int> oneLevel;
                int size = q.size();
                for (int i = 0; i < size; ++i) {
                    TreeNode *node = q.front();
                    q.pop();
                    oneLevel.push_back(node->val);
                    if (node->left) q.push(node->left);
                    if (node->right) q.push(node->right);
                }
                res.push_back(oneLevel);
            }
            return res;
        }
        
    };
    
    
    
     参考:https://www.cnblogs.com/grandyang/p/4051321.html
  • 相关阅读:
    并发编程的艺术
    Redis字符串实现,SDS与C的区别,空间预分配
    Jvm
    Redis数据结构的实现
    发一篇感谢身边的所有从事it工作的朋友
    BeanFactory 默认的注入实现类DefaultListableBeanFactory
    jsSwitch语句优化
    彻底搞懂 Nginx 的五大应用场景
    Spring Boot 整合 Quartz 轻松实现任务调度!
    js计算两个给定日期之间的天数
  • 原文地址:https://www.cnblogs.com/573177885qq/p/9671849.html
Copyright © 2011-2022 走看看