-
Notifications
You must be signed in to change notification settings - Fork 0
/
main.c
126 lines (105 loc) · 2.54 KB
/
main.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
//
// Created by Dario on 14/03/16.
//
#include <stdio.h>
#include <stdlib.h>
typedef struct tree
{
int value;
struct tree * left;
struct tree * right;
}t_tree;
typedef struct list
{
int value;
struct list * next;
}t_list;
void visit_list(t_list **ptrptr);
void list_insertion(t_list **, int);
void visit_leaf(t_tree *, t_list**);
t_tree* new_node();
int main()
{
t_tree * ptr;
t_list *ptrptr = NULL;
//è possibile inserire in runtime più nodi, basta mettere new_node dentro un while(!data) e chiedere se inserire a dx o sx
t_tree *root = new_node();
root->left = new_node();
root->right = new_node();
root->left->left = new_node();
//root->left->right = new_node();*/
root->right->left = new_node();
root->right->right = new_node();
visit_leaf(root, &ptrptr);
visit_list(&ptrptr);
}
//THOSE 2 FUNCTIONS ARE THE CORE OF LEAFTOLIST, NOW CONSTRUCT THE MAIN
void list_insertion(t_list **ptrptr, int value)
{
if(*ptrptr != NULL)
{
while(*ptrptr != NULL)
{
ptrptr = &((*ptrptr)->next);
}
if(*ptrptr != NULL)
{
t_list* tmp_ptr;
tmp_ptr = *ptrptr;
*ptrptr = (t_list*)malloc(sizeof(t_list));
(*ptrptr)->value = value;
(*ptrptr)->next = tmp_ptr;
}
else
{
*ptrptr = (t_list*)malloc(sizeof(t_list));
(*ptrptr)->value = value;
(*ptrptr)->next = NULL;
}
}
else
{
printf("\nList is empty, will insert %d at beginning\n", value);
*ptrptr = (t_list*)malloc(sizeof(t_list));
(*ptrptr)->value = value;
(*ptrptr)->next = NULL;
}
}
void visit_leaf(t_tree * ptr, t_list ** ptrptr)
{
if(ptr->left == NULL && ptr->right == NULL)
{
printf("\nLeaf value = %d\nI'm going to put it in your list\n", ptr->value);
list_insertion(ptrptr, ptr->value);
}
else
{
if(ptr->left != NULL)
{
visit_leaf(ptr->left, ptrptr);
}
if(ptr->right != NULL)
{
visit_leaf(ptr->right, ptrptr);
}
}
}
t_tree* new_node()
{
int data = 0;
printf("Insert value\n");
scanf("%d", &data);
t_tree * tree = (t_tree *)malloc(sizeof(t_tree));
tree->value = data;
tree->left = NULL;
tree->right = NULL;
return(tree);
}
void visit_list(t_list **ptrptr)
{
while((*ptrptr) != NULL)
{
printf(" %d", (*ptrptr)->value);
ptrptr = &((*ptrptr)->next);
}
}