二叉树的层次遍历 II Leetcode 107
此题为二叉树的层次遍历翻版,就是从底往上输出层次遍历结果
其实就是把二叉树的层次遍历这题最后输出reverse()就OK了
python代码:
# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution(object):
def levelOrderBottom(self, root):
"""
:type root: TreeNode
:rtype: List[List[int]]
"""
ans = []
if root==None:
return ans
sqlist = []
sqlist.append(root)
sqlist.append(None)
tmp = []
while(len(sqlist)):
p = sqlist[0]
sqlist.pop(0)
if len(sqlist)==0:
ans.append(tmp)
break
if p == None:
ans.append(tmp)
tmp = []
sqlist.append(None)
else:
tmp.append(p.val)
if p.left:
sqlist.append(p.left)
if p.right:
sqlist.append(p.right)
ans.reverse()
return ans