python代码实现二叉树的分层打印

Posted 2021-06-28 Data+Science+Insight

python代码实现二叉树的分层打印

 

#python代码实现二叉树的分层打印

class Node():
    def __init__(self, val=None):
        self.val = val
        self.left = None
        self.right = None

def printlayer(root):
    last = root
    queue = []
    queue.append(root)
    while queue:
        root = queue.pop(0)
        print(root.val, end=\'\')
        if root.left:
            nlast = root.left
            queue.append(root.left)
        if root.right:
            nlast = root.right
            queue.append(root.right)
        if root == last and queue:
            last = nlast

 

#

# Driver program to test above function
#