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 d1da20e + 423d484 commit 7a4d0f2Copy full SHA for 7a4d0f2
2018.12.04-leetcode101/Avalon.md
@@ -0,0 +1,28 @@
1
+/**
2
+ * Definition for a binary tree node.
3
+ * public class TreeNode {
4
+ * int val;
5
+ * TreeNode left;
6
+ * TreeNode right;
7
+ * TreeNode(int x) { val = x; }
8
+ * }
9
+ */
10
+class Solution {
11
+ public boolean isSymmetric(TreeNode root) {
12
+ if (root == null ){
13
+ return true;
14
+ }
15
+
16
+ return isSymmetric(root.left, root.right);
17
18
19
+ public static boolean isSymmetric(TreeNode nodeA, TreeNode node_A){
20
+ if (node_A == null && nodeA == null) {
21
22
23
+ if (node_A != null && nodeA != null) {
24
+ return node_A.val == nodeA.val && isSymmetric(nodeA.left, node_A.right) && isSymmetric(nodeA.right, node_A.left);
25
26
+ return false;
27
28
+}
0 commit comments