思路
这道题是按之字形打印二叉树的简化版本,代码唯一不同的是少了一个控制奇偶的变量
代码
# -*- coding:utf-8 -*-
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
# 返回二维列表[[1,2],[4,5]]
def Print(self, pRoot):
# write code here
if not pRoot:
return []
resultList = []
curLayer = [pRoot]
while curLayer:
curList = []
nextLayer = []
for node in curLayer:
curList.append(node.val)
if node.left:
nextLayer.append(node.left)
if node.right:
nextLayer.append(node.right)
resultList.append(curList)
curLayer = nextLayer
return resultList