cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof.py

class Solution(object):
	def levelOrder(self, root):
		"""
		:type root: TreeNode
		:rtype: List[List[int]]
		"""
		res = []
		def dfs(index,root):
			if not root:
				return
			if len(res)<index:
				res.append([])
			if index%2==0:
				res[index-1].insert(0,root.val)
			else:
				res[index-1].append(root.val)
			dfs(index+1,root.left)
			dfs(index+1,root.right)
		dfs(1,root)
		return res