題目：給定一個二叉樹的頭節點head, 分別實現按層和ZigZag打印二叉樹的函數

class Node:def __init__(self,value):self.value = valueself.left = Noneself.right = Nonedef printByLevel(head):if head == None:return NoneQueue = []level = 1last = headnlast = Noneprint("level " + str(level) + ":")level +=1Queue.append(head)while len(Queue)!=0:node = Queue.pop(0)if node.left!=None:Queue.append(node.left)nlast = node.leftif node.right!=None:Queue.append(node.right)nlast = node.rightif head == last and len(Queue)!=0:print("\n")print("level " + str(level) + ":")level +=1last = nlast ZigZag打印實現def printByZigZag(head):if head == None:returndequeue = []dequeue.append(head)islr = Truelast = headnlast = Nonelevel = 1print("level " + str(level) + ":")level +=1while len(queue)!=0:if islr:head = dequeue.pop(0)print(head.value)if head.left:if nlast == None:nlast = head.leftdequeue.append(head.left)if head.right:if nlast == None:nlast = head.rightdequeue.append(head.right)else:head = dequeue.pop()print(head.value)if head.right:if nlast == None:nlast = head.rightdequeue.insert(0,head.right)if head.left:if nlast == None:nlast = head.leftdequeue.insert(0,head.left)if head == last and dequeue:islr = not islrlast = nlastnlast = Nonelevel +=1print("level " + str(level) + ":")leve +=1

?

總結

以上是生活随笔為你收集整理的二叉树的按层打印和ZigZag打印的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。