【LEETCODE】102-Binary Tree Level Order Traversal

Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).

For example:

Given binary tree {3,9,20,#,#,15,7},

    3

   / \

  9  20

    /  \

   15   7

return its level order traversal as:

[

  [3],

  [9,20],

  [15,7]

]

# 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 preorder(self,root,level,ans):
        
        if root:           #下面函数里，已经有了return ans，所以此函数里就算不判断root是否为空，空的时候也会在主函数里返回［］
            
            if len(ans)<level+1:
                ans.append([])
                
            ans[level].append(root.val)
            
            #level+=1      不能在这里加，否则，遍历完一个left就会level自身＋1了
            
            self.preorder(root.left,level+1,ans)    
            self.preorder(root.right,level+1,ans)
            
    
    def levelOrder(self, root):
        """
        :type root: TreeNode
        :rtype: List[List[int]]
        """
        ans = []
        
        self.preorder(root,0,ans)
        
        return ans