leedcode解题--二叉树的层次遍历 II（python）

题目

给定一个二叉树，返回其节点值自底向上的层次遍历。 （即按从叶子节点所在层到根节点所在的层，逐层从左向右遍历）
例如：
给定二叉树 [3,9,20,null,null,15,7],
3
/ \
9 20
/ \
15 7
返回其自底向上的层次遍历为：
[
[15,7],
[9,20],
[3]
]

代码

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

class Solution:
    def levelOrderBottom(self, root):
        """
        :type root: TreeNode
        :rtype: List[List[int]]
        """
        if root is None:
            return []
        p= [root]
        results=[]
        current_level_num=1
        next_level_num=0
        d=[]
        while p:
            current=p.pop(0)
            d.append(current.val)
            current_level_num -=1
            if current.left !=None:
                p.append(current.left)
                next_level_num += 1
            if current.right != None:
                p.append(current.right)
                next_level_num +=1
            if current_level_num == 0:
                current_level_num = next_level_num
                next_level_num=0
                results.append(d)
                d =[]
        return results[::-1]