题目描述
请实现一个函数,用来判断一棵二叉树是不是对称的。注意,如果一个二叉树同此二叉树的镜像是同样的,定义其为对称的。
# -*- coding:utf-8 -*-
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def isSymmetrical(self, pRoot):
# write code here
return self.judgesame(pRoot,pRoot)
def judgesame(self,proot1,proot2):
if not proot1 and not proot2:
return True
elif not proot1 or not proot2:
return False
elif proot1.val != proot2.val:
return False
else:
return self.judgesame(proot1.left, proot2.right) and self.judgesame(proot1.right, proot2.left)