gramppto99138/Info2DopleSpiel
1
0
Fork 0
generated from freudenreichan/info2Praktikum-DobleSpiel
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

rebuilt everything to be as buggy, as 3 Versions ago

Browse Source
This commit is contained in:
Tobias Grampp 2025-12-08 13:51:51 +01:00
parent 85b05133ea
commit fdfa3c5769
4 changed files with 31 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
bintree.c
View File

@ -55,25 +55,31 @@ void *nextTreeData(TreeNode *root)
printf("nextTreeData wurde gecallt!\n"); printf("nextTreeData wurde gecallt!\n");
if(root) if(root)
{ {
addTreeToStack(stackRoot, root); stackRoot = addTreeToStack(stackRoot, root);
printf("Baum wurde geladen!\n"); printf("Baum wurde geladen!\n");
} }
void *buffer = pop(stackRoot); printf("\n\nstackRoot ist: %x\n\n", stackRoot);
StackNode *stackPuffer = pop(stackRoot);
if(!stackPuffer)
printf("Something went horriffically wrong! There is no Data!");
void *buffer = (stackPuffer->stackData);
printf("neuer Eintrag wurde geholt: %x\n", buffer); printf("neuer Eintrag wurde geholt: %x\n", buffer);
return buffer; return buffer;
} }
// Adds all Treenode-Datas of a root into a stack ordered from left to right // Adds all Treenode-Datas of a root into a stack ordered from left to right
void addTreeToStack(StackNode *start, TreeNode *root) StackNode *addTreeToStack(StackNode *start, TreeNode *root)
{ {
if(root->left) if(root->left)
{ {
addTreeToStack(start, root->left); start = addTreeToStack(start, root->left);
} }
push(start, root->data); start = push(start, root->data);
printf("\na new Dataset has been added! new stackRoot: %x", start);
if(root->right) if(root->right)
{ {
addTreeToStack(start, root->right); start = addTreeToStack(start, root->right);
} }
return start;
} }
// Releases all memory resources (including data copies). // Releases all memory resources (including data copies).

2
bintree.h
View File

@ -26,5 +26,5 @@ void clearTree(TreeNode *root);
// Returns the number of entries in the tree given by root. // Returns the number of entries in the tree given by root.
unsigned int treeSize(const TreeNode *root); unsigned int treeSize(const TreeNode *root);
// Adds all Treenode-Datas of a root into a stack ordered from left to right // Adds all Treenode-Datas of a root into a stack ordered from left to right
void addTreeToStack(StackNode *start, TreeNode *root); StackNode *addTreeToStack(StackNode *start, TreeNode *root);
#endif #endif

10
highscores.txt
View File

@ -0,0 +1,10 @@
Ottp;4522070
Ottp;4522070
Ottp;4522070
Ottp;4522070
Ottp;4522070
Ottp;4522070
Ottp;4522070
Ottp;4522070
Ottp;4522070
Ottp;4522070

11
stack.c
View File

@ -1,4 +1,5 @@
#include <stdlib.h> #include <stdlib.h>
#include <stdio.h>
#include "stack.h" #include "stack.h"
//TODO: grundlegende Stackfunktionen implementieren: //TODO: grundlegende Stackfunktionen implementieren:
@ -33,14 +34,18 @@ StackNode *push(StackNode *stack, void *data)
// freed by caller.) // freed by caller.)
StackNode *pop(StackNode *stack) StackNode *pop(StackNode *stack)
{ {
printf("A stack is being popped");
if(stack) { if(stack) {
StackNode* temp = stack; StackNode* temp = stack;
stack = stack->below; stack = stack->below;
temp->stackData = NULL; temp->stackData = NULL;
free(temp); //free(temp);
temp = NULL; //temp = NULL;
printf("Stack returns stack at: %x\n", stack);
return stack; return stack;
} else { }
else
{
return NULL; return NULL;
} }
} }