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 fa4dd79 + 5186efb commit 559de1bCopy full SHA for 559de1b
2018.12.4-leetcode101/张小胖.md
@@ -0,0 +1,25 @@
1
+ /**
2
+ Definition for a binary tree node.
3
+ struct TreeNode{
4
+ int val;
5
+ TreeNode *left;
6
+ TreeNode *right;
7
+ TreeNode(int x) : val(x),left(NULL),right(NULL) {}
8
+ };
9
+ */
10
+ class Solution{
11
+ public:
12
+ bool isSymmetric(TreeNode* root){
13
+ if(root==0)
14
+ return true;
15
+ return CompareNodes(root->left,root->right);
16
+ }
17
18
+ bool CompareNodes(TreeNode* node1,TreeNode* node2){
19
+ if(node1==0&&node2==0) return true;
20
+ if(node1==0||node2==0) return false;
21
+ if(node1->val!=node2->val) return false;
22
+ else
23
+ return CompareNodes(node1->left,node2->right)&&CompareNodes(node1->right,node2->left);
24
25
0 commit comments