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 4eaff4d + fe5a978 commit d4524f6Copy full SHA for d4524f6
2018.12.04-leetcode101/sourcema.md
@@ -0,0 +1,27 @@
1
+# LeetCode 101
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
+ if (root == null) {
14
+ return true;
15
+ }
16
+ return symmetric(root.left, root.right);
17
18
+ private boolean symmetric(TreeNode p, TreeNode q) {
19
+ if (p == null && q == null) {
20
21
22
+ if ((p == null && q != null) || (p != null && q == null) || p.val != q.val) {
23
+ return false;
24
25
+ return symmetric(p.left, q.right) && symmetric(p.right, q.left);
26
27
0 commit comments