以下是使用 Python 语言，通过队列来判断二叉树是否轴对称的示例代码： ```python # 定义二叉树节点类 class TreeNode: def __init__(self, val=0, left=None, right=None): self.val = val self.left = left self.right = right def is_symmetric(root): queue = [(root, root)] while queue: node1, node2 = queue.pop(0) if not node1 and not node2: continue if not node1 or not node2 or node1.val!= node2.val: return False queue.append((node1.left, node2.right)) queue.append((node1.right, node2.left)) return True ``` [2024-09-12 21:21:32 | AI写代码神器 | 173点数解答]