题解 | #对称的二叉树#

# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 
# @param pRoot TreeNode类 
# @return bool布尔型
#
class Solution:
    def isSymmetrical(self , pRoot: TreeNode) -> bool:
        # write code here
        if pRoot is None:
            return True
        return self.rTree(pRoot.left, pRoot.right)

    def rTree(self, left, right) -> bool:
        if left is None and right is None:
            return True
        if left is None or right is None:
            return False
        if left.val == right.val:
            return self.rTree(left.left,right.right) and self.rTree(left.right, right.left)
        return False

ref:

https://blog.csdn.net/u010005281/article/details/79734505