首先复制一个树,然后传入,递归的判断左右两边是否相同,相同就是对称树。终止条件就是遍历完,遍历的过程中需要不断的返回判断的结果。
class Solution:
def isSymmetrical(self, pRoot):
def judge(pRoot,Root):
if pRoot == None and Root == None:
return True
if pRoot is None or Root is None:
return False
if pRoot.val != Root.val:
return False
return judge(pRoot.left, Root.right) and judge(pRoot.right,Root.left)
return judge(pRoot,pRoot)