levelOrderBottom

好久没来了，今天刷了一道树的题，时间还是以小时记，好像用微博二哈的表情

daydayup；

这次的daydayup就是一定要注意对空节点的处理

class Solution(object):
    def levelOrderBottom(self, root):
        """
        :type root: TreeNode
        :rtype: List[List[int]]
        """
        res =[]
        if not root:
            return res
        else:
            Nodelist = [root]
            j = [root.val]
            res.append(j)
            i = 0
            while Nodelist:
                tree  = []
                j = []
                for node in Nodelist:
                    if node.left:
                        j.append(node.left.val)
                        tree.append(node.left)
                    if node.right:
                        j.append(node.right.val)
                        tree.append(node.right)
                Nodelist = tree
                if j:
                    res.append(j)
            res = list(reversed(res))
            return res