剑指offer-python：26.对称的二叉树

Input: root = [1,2,2,3,4,4,3]
Output: true

Input: root = [1,2,2,null,3,null,3]
Output: false

 代码：

# 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 isSymmetric(self, root: Optional[TreeNode]) -> bool:
        def judge(n_left , n_right):
            if n_left and n_right:
                return (n_left.val == n_right.val 
                and judge(n_left.left , n_right.right ) 
                and judge(n_left.right ,  n_right.left))
            else:
                return False
        if not root:
            return True
        return judge(root.left , root.right)