题解 | #按之字形顺序打印二叉树#

# -*- coding:utf-8 -*-
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
class Solution:
    def Print(self, pRoot):
        # write code here
        if not pRoot: return
        queue=[pRoot]
        node=pRoot
        count=1
        level=[[pRoot.val]]
        while queue:
            nodes=[]
            while queue:
                node=queue.pop()
                #print(out)
                if count%2==0:
                    if node.left: nodes.append(node.left)
                    if node.right: nodes.append(node.right)
                else:
                    if node.right: nodes.append(node.right)
                    if node.left: nodes.append(node.left)
            count+=1
            queue=nodes
            level.append([i.val for i in nodes])
            
        level.pop()
        return level