基础算法（Leetcode）刻意练习第二十天——对称二叉树

LeetCode101题
思路也不难，递归，每次比较当前左节点的左孩子和右节点的右孩子，和比较左节点的右孩子和右节点的左孩子。边界情况处理。

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def isSymmetric(self, root: TreeNode) -> bool:
        def check(nl,nr):
            if not nl and not nr:
                return True
            if not nl or not nr:
                return False
            if nl.val!=nr.val:
                return False
            return check(nl.left,nr.right) and check(nl.right,nr.left)
            
        return check(root,root)