LeetCode Task20. 对称二叉树

题目

101. 对称二叉树

解答

代码

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

class Solution(object):
	def isSymmetric(self, root):
		"""
		:type root: TreeNode
		:rtype: bool
		"""
		if not root:
			return True
		def twotree(left,right):
			if not (left or right):
				return True
			if not (left and right):
				return False
			if left.val!=right.val:
				return False
			return twotree(left.left,right.right) and twotree(left.right,right.left)
		return twotree(root.left,root.right)

思路

递归

结果