8000
We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent ee8d814 commit 4ed3c71Copy full SHA for 4ed3c71
isSymmetric.py
@@ -0,0 +1,22 @@
1
+# Definition for a binary tree node.
2
+# class TreeNode(object):
3
+# def __init__(self, x):
4
+# self.val = x
5
+# self.left = None
6
+# self.right = None
7
+
8
+class Solution(object):
9
+ def isSymmetric(self, root):
10
+ """
11
+ :type root: TreeNode
12
+ :rtype: bool
13
14
+ if root == None:
15
+ return True
16
+ return self.isMirror(root.left, root.right)
17
+ def isMirror(self, tree1, tree2):
18
+ if tree1 == None or tree2 == None:
19
+ return tree1 == tree2
20
+ if tree1.val != tree2.val:
21
+ return False
22
+ return self.isMirror(tree1.left, tree2.right) and self.isMirror(tree1.right, tree2.left)
0 commit comments