-
Notifications
You must be signed in to change notification settings - Fork 288
/
Copy pathAC_recursive_n.cpp
45 lines (38 loc) · 906 Bytes
/
AC_recursive_n.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
/*
* Author: illuz <iilluzen[at]gmail.com>
* File: AC_recursive_n.cpp
* Create Date: 2014-12-19 08:41:32
* Descripton: recursive
*/
#include <bits/stdc++.h>
using namespace std;
const int N = 0;
// Definition for binary tree
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
class Solution {
private:
bool isSymmetric(TreeNode *p, TreeNode *q) {
if (p == NULL)
return q == NULL;
if (q == NULL)
return p == NULL;
if (p->val != q->val)
return false;
return isSymmetric(p->left, q->right) &&
isSymmetric(p->right, q->left);
}
public:
bool isSymmetric(TreeNode *root) {
if (root == NULL)
return true;
return isSymmetric(root->left, root->right);
}
};
int main() {
return 0;
}