forked from lennylxx/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
100.c
59 lines (52 loc) · 1.37 KB
/
100.c
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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
};
bool isSameTree(struct TreeNode *p, struct TreeNode *q) {
if (p == NULL && q == NULL)
return true;
else if (p && q) {
if (p->val == q->val
&& isSameTree(p->left, q->left)
&& isSameTree(p->right, q->right))
return true;
else return false;
}
else return false;
}
void printTreePreOrder(struct TreeNode *p) {
if (p != NULL) {
printf("%d", p->val);
printTreePreOrder(p->left);
printTreePreOrder(p->right);
}
else printf("#");
}
int main() {
struct TreeNode *t = (struct TreeNode *)calloc(3, sizeof(struct TreeNode));
struct TreeNode *p = t;
p->val = 1;
p->left = ++t;
t->val = 2;
t->left = t->right = NULL;
p->right = ++t;
t->val = 3;
t->left = t->right = NULL;
printTreePreOrder(p); printf("\n");
t = (struct TreeNode *)calloc(3, sizeof(struct TreeNode));
struct TreeNode *q = t;
q->val = 1;
q->left = ++t;
t->val = 2;
t->left = t->right = NULL;
q->right = ++t;
t->val = 4;
t->left = t->right = NULL;
printTreePreOrder(q); printf("\n");
printf("%d\n", isSameTree(p, q));
return 0;
}