Python, LintCode, 71. 二叉树的锯齿形层次遍历

"""
Definition of TreeNode:
class TreeNode:
    def __init__(self, val):
        self.val = val
        self.left, self.right = None, None
"""

class Solution:
    """
    @param root: A Tree
    @return: A list of lists of integer include the zigzag level order traversal of its nodes' values.
    """
    def zigzagLevelOrder(self, root):
        # write your code here
        if root is None:
            return []
        res = []
        node = []
        node.append(root)
        flag = 1
        while len(node) is not 0:
            row = []
            for i in range(len(node)):
                if node[0].left:
                    node.append(node[0].left)
                if node[0].right:
                    node.append(node[0].right)
                row.append(node.pop(0).val)
            row = row[::flag]
            res += [row]
            flag *= -1
        return res