python：特定深度节点链表

给定一棵二叉树，设计一个算法，创建含有某一深度上所有节点的链表（比如，若一棵树的深度为 D，则会创建出 D 个链表）。返回一个包含所有深度的链表的数组。
示例：
输入：[1,2,3,4,5,null,7,8]

        1
       /  \ 
      2    3
     / \    \ 
    4   5    7
   /
  8

输出：[[1],[2,3],[4,5,7],[8]]

一、广度搜索

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
    def listOfDepth(self, tree: TreeNode) -> List[ListNode]:
        if tree == None:
            return
        level = [0]
        helper = [tree]
        head = ListNode()
        ans = []
        pre = -1
        while helper:
            t = helper.pop(-1)
            tlevel = level.pop(-1)
            if tlevel == pre:
                head.next = ListNode(t.val)
                head = head.next
            else:
                head = ListNode(t.val)
                ans.append(head)
                pre += 1
            if t.left:
                helper.insert(0,t.left)
                level.insert(0,tlevel+1)
            if t.right:
                helper.insert(0,t.right)
                level.insert(0,tlevel+1)
        return ans

二、深度搜索

class Solution:
    def listOfDepth(self, root: TreeNode) -> List[ListNode]:
        ans = []
        def dfs(node, level):
            if not node: return None
            if len(ans) == level:
                ans.append(ListNode(node.val))
            else:
                head = ListNode(node.val)
                head.next = ans[level]
                ans[level] = head
            dfs(node.right, level + 1)
            dfs(node.left, level + 1)
        dfs(root, 0)
        return ans