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 9ef499b + f25674c commit 02a1b0fCopy full SHA for 02a1b0f
2018.12.4-leetcode101/云溪101.md
@@ -0,0 +1,21 @@
1
+bool isSymmetricHelp(struct TreeNode* left,struct TreeNode* right);
2
+/**
3
+ * Definition for a binary tree node.
4
+ * struct TreeNode {
5
+ * int val;
6
+ * struct TreeNode *left;
7
+ * struct TreeNode *right;
8
+ * };
9
+ */
10
+bool isSymmetric(struct TreeNode* root)
11
+{
12
+ return root==NULL|| isSymmetricHelp(root->left,root->right);
13
+}
14
+bool isSymmetricHelp(struct TreeNode* left,struct TreeNode* right)
15
16
+ if(left==NULL||right==NULL)
17
+ return left==right;
18
+ if(left->val==right->val&&isSymmetricHelp(left->left,right->right)&&isSymmetricHelp(left->right,right->left))
19
+ return true;
20
+ return false;
21
0 commit comments