C语言使用void *类型作为函数传参

解题思路

python列表可以很简单用reverse，remove的方法来实现双向队列，所以很简单

AC代码

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:
        if not root:
            return []
        queue = [root]
        flag = True
        res = []
        while queue:
            templist = []
            if flag:
                length = len(queue)
                for _ in range(length):
                    temp = queue[0]
                    templist.append(temp.val)
                    if temp.left: queue.append(temp.left)
                    if temp.right: queue.append(temp.right)
                    queue.remove(temp)
                flag = not flag
            else:
                length = len(queue)
                for i in range(length - 1, -1, -1):
                    temp = queue[i]
                    templist.append(temp.val)
                    if temp.right: queue.append(temp.right)   
                    if temp.left: queue.append(temp.left)
                    queue.remove(temp)
                queue.reverse()
                flag = not flag
            res.append(templist)
        
        return res