ergz/tlacyl
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

fixed, was just i was trying to get value for freed mem

Browse Source
This commit is contained in:
Emanuel Rodriguez
2023-06-30 07:25:01 -07:00
parent cfaf438fd4
commit 30315e6d29
2 changed files with 36 additions and 19 deletions
Download Patch File Download Diff File Expand all files Collapse all files

BIN
c/a.out
View File

Binary file not shown.

55
c/stack.c
View File

@@ -28,7 +28,7 @@ typedef struct Stack {
Node* new_node(int value) { Node* new_node(int value) {
Node* n = malloc(sizeof(Node)); Node* n = malloc(sizeof(Node));
n->value = value; n->value = value;
n->next = NULL;
return (n); return (n);
} }
@@ -56,7 +56,7 @@ bool pop(Stack* s) {
} }
void delete_stack(Stack* s) { void delete_stack(Stack* s) {
while (s->length > 0) { while (s->head != NULL) {
pop(s); pop(s);
} }
} }
@@ -74,6 +74,14 @@ void push(Stack* s, Node* n) {
} }
} }
int peek(Stack* s) {
if (s->length == 0) {
return -1;
}
return s->head->value;
}
int main() { int main() {
Stack* s = new_stack(); Stack* s = new_stack();
@@ -83,35 +91,44 @@ int main() {
Node* d = new_node(13); Node* d = new_node(13);
push(s, a); push(s, a);
printf("the value at the top of the stack is: %d\n", s->head->value); printf("the value at the top of the stack is: %d\n", peek(s));
printf("the length of the stack is: %d\n", s->length); printf("the length of the stack is: %d\n", s->length);
push(s, b); push(s, b);
printf("the value at the top of the stack is: %d\n", s->head->value); printf("the value at the top of the stack is: %d\n", peek(s));
printf("the length of the stack is: %d\n", s->length); printf("the length of the stack is: %d\n", s->length);
push(s, c); push(s, c);
printf("the value at the top of the stack is: %d\n", s->head->value); printf("the value at the top of the stack is: %d\n", peek(s));
printf("the length of the stack is: %d\n", s->length); printf("the length of the stack is: %d\n", s->length);
push(s, d); push(s, d);
printf("the value at the top of the stack is: %d\n", s->head->value); printf("the value at the top of the stack is: %d\n", peek(s));
printf("the length of the stack is: %d\n", s->length); printf("the length of the stack is: %d\n", s->length);
bool res = pop(s); // bool res = pop(s);
printf("the value at the top of the stack is: %d\n", s->head->value); // printf("the value at the top of the stack is: %d\n", peek(s));
printf("the length of the stack is: %d\n", s->length); // printf("the length of the stack is: %d\n", s->length);
res = pop(s); // res = pop(s);
printf("the value at the top of the stack is: %d\n", s->head->value); // printf("the value at the top of the stack is: %d\n", peek(s));
printf("the length of the stack is: %d\n", s->length); // printf("the length of the stack is: %d\n", s->length);
res = pop(s); // res = pop(s);
printf("the value at the top of the stack is: %d\n", s->head->value); // printf("the value at the top of the stack is: %d\n", peek(s));
printf("the length of the stack is: %d\n", s->length); // printf("the length of the stack is: %d\n", s->length);
res = pop(s); // res = pop(s);
printf("the value at the top of the stack is: %d\n", s->head->value); // printf("the value at the top of the stack is: %d\n", peek(s));
printf("the length of the stack is: %d\n", s->length); // printf("the length of the stack is: %d\n", s->length);
// res = pop(s);
// printf("the value at the top of the stack is: %d\n", peek(s));
// printf("the length of the stack is: %d\n", s->length);
// res = pop(s);
// printf("the value at the top of the stack is: %d\n", peek(s));
// printf("the length of the stack is: %d\n", s->length);
// res = pop(s);
// printf("the value at the top of the stack is: %d\n", peek(s));
// printf("the length of the stack is: %d\n", s->length);
// delete_stack(s); delete_stack(s);
return (0); return (0);
} }