-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathimplement of stack .c
133 lines (115 loc) · 2.28 KB
/
implement of stack .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
#include <limits.h>
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
// satck [data->next]
struct stack {
int data;
struct stack* next;
};
typedef struct stack* Stack;
Stack createStack(int);
void push();
void append(Stack*, int);
int pop(Stack*);
void printStack(Stack);
int len(Stack);
Stack createStack(int data){
Stack stack = (Stack)malloc(sizeof(Stack));
stack->data = data;
stack->next = NULL;
return stack;
}
void push(Stack* root, int data){
Stack newNode = createStack(data);
if(root == NULL){
*root = newNode;
return;
}
newNode->next = *root;
*root = newNode;
}
void append(Stack* root, int data){
Stack newNode = createStack(data);
Stack temp = *root;
if(*root == NULL){
*root = newNode;
return;
}
while(temp->next != NULL){
temp = temp->next;
}
temp->next = newNode;
return ;
}
int pop(Stack* root){
if(*root == NULL)
return INT_MIN;
Stack temp = *root;
int result = temp->data;
(*root) = (*root)->next;
free(temp);
return result;
}
void printStack(Stack root){
Stack temp = root;
int l = len(temp);
printf("[");
for(int i = 1; i <= l; i++){
if(i>1)
printf(",");
printf("%d",temp->data);
temp = temp->next;
}
printf("]\n");
}
int len(Stack root){
int l = 0;
Stack temp = root;
while(temp != NULL){
l++;
temp = temp->next;
}
return l;
}
void printArray(int n,int arr[n]){
printf("[");
for(int i = 0; i < n; i++){
if(i>0)
printf(",");
printf("%d",arr[i]);
}
printf("]\n");
}
int main(void) {
srand(time(NULL));
int n = 10;
int arr[n];
Stack root;
for(int i = 0 ; i < n; i++){
arr[i] = rand()%10;
}
printf("Dizi elamanları: ");
printArray(n,arr);
printf("dizideki elamanları stack’e yerleştirecek\n");
for(int i = 0 ; i < n; i++){
if(i == 0){
printf("Başına %d eklemeler. ",arr[i]);
root = createStack(arr[i]);
}
else{
if(rand()%3 == 0){
printf("Başına %d eklemeler. ",arr[i]);
push(&root, arr[i]);
}else if(rand()%3 == 1){
printf("Stackten %d element silindi . ", pop(&root));
}
else{
printf("sonuna %d eklemeler. ",arr[i]);
append(&root, arr[i]);
}
}
printStack(root);
}
return 0;
}