binary-tree-level-order-traversal-ii.txt

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

class Solution:
    # @param root, a tree node
    # @return a list of lists of integers
    def levelOrderBottom(self, root):
		if root == None:
			return []
		temp = [[root]]
		while True:
			row = []
			for p in temp[-1]:
				if p.left != None:
					row.append(p.left)
				if p.right != None:
					row.append(p.right)
			if len(row) > 0:
				temp.append(row)
			else:
				break
		
		res = []
		for row in temp:
			buf = []
			for node in row:
				buf.append(node.val)
			res.append(buf)
		res.reverse()
		return res