python实现二叉树层次遍历

每到一层创建一个list保存该层的node，投入下一次使用，递归方式。

class TreeNode: # 创建二叉树
def init(self, x):
self.val = x
self.left = None
self.right = None

class Solution:
def layer_append(self, root):
res = []
def search(nodes, ans):
if not nodes:
return
lis = []
for node in nodes: # 遍历上一轮记录的节点
if node.left:
lis.append(node.left) # 记录当前节点的儿子们
if node.right:
lis.append(node.right)
ans.append(node.val) # 保存本轮节点值
search(lis, ans)
search([root], res)
return res

if name==‘main’:
solution=Solution()
A1 = TreeNode(1)
A2 = TreeNode(2)
A3 = TreeNode(3)
A4 = TreeNode(4)
A5 = TreeNode(5)
A6 = TreeNode(6)
A7 = TreeNode(7)
A8 = TreeNode(8)
A9 = TreeNode(9)

A1.left=A2
A1.right=A3
A2.left=A4
A2.right=A5
A3.left = A7
A3.right = A6
A5.left = A8
A5.right = A9
ans=solution.PrintFromTopToBottom(A1)
print(ans)