【leetcode】Python实现-107.二叉树的层次遍历 II

107.二叉树的层次遍历 II

描述

我又研究了一下树的四种遍历，不然之前学的全忘光了。温故而知新！

    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]