-
Notifications
You must be signed in to change notification settings - Fork 0
/
100 Same Tree.c
76 lines (60 loc) · 1.49 KB
/
100 Same Tree.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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* };
*/
void preorder(struct TreeNode* root, int * tmp_arr, int * tmp_arr_index)
{
if(root == NULL)
return;
tmp_arr[(*tmp_arr_index)++] = root->val;
if((root->left == NULL) && (root->right != NULL))
{
tmp_arr[(*tmp_arr_index)++] = INT_MIN;
}
preorder(root->left, tmp_arr, tmp_arr_index);
if((root->right == NULL) && (root->left != NULL))
{
tmp_arr[(*tmp_arr_index)++] = INT_MIN;
}
preorder(root->right, tmp_arr, tmp_arr_index);
return;
}
int nodes(struct TreeNode * root)
{
if(root == NULL)
return 0;
int left = nodes(root->left);
int right = nodes(root->right);
return (left + right + 1);
}
bool isSameTree(struct TreeNode* p, struct TreeNode* q)
{
int * p_arr = (int *)malloc(sizeof(int) * 200);
int p_arr_index = 0;
preorder(p, p_arr, &p_arr_index);
int * q_arr = (int *)malloc(sizeof(int) * 200);
int q_arr_index = 0;
preorder(q, q_arr, &q_arr_index);
if(q_arr_index != p_arr_index)
return false;
else
{
int i=0;
for(i=0; i<p_arr_index; i++)
{
if(p_arr[i] != q_arr[i])
{
free(p_arr);
free(q_arr);
return false;
}
}
}
free(p_arr);
free(q_arr);
return true;
}