-
Notifications
You must be signed in to change notification settings - Fork 0
/
1367 Linked List in Binary Tree.c
141 lines (119 loc) · 2.85 KB
/
1367 Linked List in Binary 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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* };
*/
#define MAX_ELEMENTS 100
#define TREE_MAX_ELEMENTS 2500
struct TreeNode * tree_arr[TREE_MAX_ELEMENTS] = {NULL};
typedef struct
{
struct ListNode * arr[MAX_ELEMENTS];
int top;
}Stack;
int isStackFull(Stack * tmp_stack)
{
if(tmp_stack->top == MAX_ELEMENTS-1)
return 1;
else
return 0;
}
int isStackEmpty(Stack * tmp_stack)
{
if(tmp_stack->top == -1)
return 1;
else
return 0;
}
void push(Stack * tmp_stack, struct ListNode * element)
{
if(isStackFull(tmp_stack))
return;
tmp_stack->arr[++(tmp_stack->top)] = element;
}
struct ListNode * pop(Stack * tmp_stack)
{
if(isStackEmpty(tmp_stack))
return NULL;
return tmp_stack->arr[(tmp_stack->top)--];
}
void preorder(struct ListNode * head, struct TreeNode * root, Stack * tmp_stack, bool * result)
{
if(root == NULL)
return;
if(root->val == head->val)
{
push(tmp_stack, head);
if(head->next == NULL)
{
*result = true;
return;
}
preorder(head->next, root->left, tmp_stack, result);
if(isStackEmpty(tmp_stack))
{
push(tmp_stack, head);
}
preorder(head->next, root->right, tmp_stack, result);
struct ListNode * pop_node = pop(tmp_stack);
}
else
{
while(!isStackEmpty(tmp_stack))
{
struct ListNode * pop_node = pop(tmp_stack);
if(isStackEmpty(tmp_stack))
{
head = pop_node;
}
}
if(root->val == head->val)
{
preorder(head, root, tmp_stack, result);
}
else
{
preorder(head, root->left, tmp_stack, result);
preorder(head, root->right, tmp_stack, result);
}
}
}
void head_root_find(struct ListNode* head, struct TreeNode* root, int * ret_index)
{
if(root == NULL)
return;
if(root->val == head->val)
{
tree_arr[*ret_index] = root;
*ret_index += 1;
}
head_root_find(head, root->left, ret_index);
head_root_find(head, root->right, ret_index);
}
bool isSubPath(struct ListNode* head, struct TreeNode* root)
{
bool result = false;
Stack tmp_stack;
tmp_stack.top = -1;
memset(tree_arr, NULL, sizeof(tree_arr));
int ret_index = 0;
int i=0;
head_root_find(head, root, &ret_index);
for(i=0; i<ret_index; i++)
{
preorder(head, tree_arr[i], &tmp_stack, &result);
if(result == true)
break;
}
return result;
}