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

# -*- 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
        res_temp = []
        res = []
        if not pRoot:
            return res
        stack = []
        next_s = []
        stack.append(pRoot)
        flag = 1
        while stack:
            res_temp = []
            for item in stack:
                res_temp.append(item.val)
                if item.left:
                    next_s.append(item.left)
                if item.right:
                    next_s.append(item.right)
            res.append(res_temp[::flag])
            flag*=-1
            stack = next_s
            next_s = []
        return res