树-429. N叉树的层序遍历-PYTHON/JAVA

最新推荐文章于 2022-05-29 16:05:28 发布

宋建国

最新推荐文章于 2022-05-29 16:05:28 发布

阅读量235

点赞数

分类专栏： LEETCODE

本文链接：https://blog.csdn.net/hot7732788/article/details/105989926

版权

LEETCODE 专栏收录该内容

64 篇文章 0 订阅

订阅专栏

在这里插入图片描述

使用队列进行广度优先遍历

/*
// Definition for a Node.
class Node {
    public int val;
    public List<Node> children;

    public Node() {}

    public Node(int _val) {
        val = _val;
    }

    public Node(int _val, List<Node> _children) {
        val = _val;
        children = _children;
    }
};
*/

class Solution {
    public List<List<Integer>> levelOrder(Node root) {
        List<List<Integer>> result = new ArrayList<>();
        if (root == null) return result;
        Queue<Node> queue = new LinkedList<>();//采用链表的存储结构形成队列
        queue.add(root);
        while (!queue.isEmpty()) {
            List<Integer> level = new ArrayList<>();//设立一个专门存储数值的list用于返回使用
            int size = queue.size();//统计当前同层的元素个数
            for (int i = 0; i < size; i++) {
                Node node = queue.poll();//逐一取出元素，将值输入到返回数组，并将孩子节点放到队列中
                level.add(node.val);
                queue.addAll(node.children);
            }
            result.add(level);
        }
        return result;


    }
}

"""
# Definition for a Node.
class Node(object):
    def __init__(self, val=None, children=None):
        self.val = val
        self.children = children
"""

class Solution(object):
    def levelOrder(self, root):
        """
        :type root: Node
        :rtype: List[List[int]]
        """
        if not root:return []

        res = list()
        queue = list()
        queue.append(root)
        while queue:
            level = list()
            print(queue)
            for _ in range(len(queue)):
                node = queue.pop(0) 
                level.append(node.val)
                queue += node.children
            res.append(level)
        return res

def levelOrder(self, root: 'Node') -> List[List[int]]:
    if root is None:
        return []
    result = []
    queue = collections.deque([root])
    while queue:
        level = []
        for _ in range(len(queue)):
            node = queue.popleft()
            level.append(node.val)
            queue.extend(node.children)
        result.append(level)
    return result

递归

/*
// Definition for a Node.
class Node {
    public int val;
    public List<Node> children;

    public Node() {}

    public Node(int _val) {
        val = _val;
    }

    public Node(int _val, List<Node> _children) {
        val = _val;
        children = _children;
    }
};
*/

class Solution {
    private List<List<Integer>> result = new ArrayList<>(); //一个空列表

    public List<List<Integer>> levelOrder(Node root) {
        if (root != null) helper(root,0);
        return result;
    }

    private void helper(Node node,int level){
        if (result.size() == level){
            result.add(new ArrayList<>());
        }
        result.get(level).add(node.val);
        for (Node child : node.children){ //增强for循环
            helper(child,level + 1);
        }
    }

    
}

"""
# Definition for a Node.
class Node(object):
    def __init__(self, val=None, children=None):
        self.val = val
        self.children = children
"""

class Solution(object):
    def levelOrder(self, root):
        """
        :type root: Node
        :rtype: List[List[int]]
        """
        if not root:return []

        def helper(node,level):
            if len(result) == level: //通过标志当前层数控制递归函数
                result.append([])
            result[level].append(node.val)
            for child in node.children:
                helper(child,level+1) //每一个孩子调用函数时都指定了相应的行数，所以将利用于栈操作的递归同样使用在队列中
        
        result = list()
        helper(root,0)
        return result