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.
2 parents cfbfb76 + eb97b43 commit 53d5a81Copy full SHA for 53d5a81
2018.12.04-leetcode101/Saul.md
@@ -0,0 +1,24 @@
1
+```java
2
+/**
3
+ * Definition for a binary tree node.
4
+ * public class TreeNode {
5
+ * int val;
6
+ * TreeNode left;
7
+ * TreeNode right;
8
+ * TreeNode(int x) { val = x; }
9
+ * }
10
+ */
11
+class Solution {
12
+ public boolean isSymmetric(TreeNode root) {
13
+ return isMirror(root, root);
14
+}
15
+
16
+public boolean isMirror(TreeNode t1, TreeNode t2) {
17
+ if (t1 == null && t2 == null) return true;
18
+ if (t1 == null || t2 == null) return false;
19
+ return (t1.val == t2.val)
20
+ && isMirror(t1.right, t2.left)
21
+ && isMirror(t1.left, t2.right);
22
23
24
+```
0 commit comments