Mineplay/Fledasty
1
0
Fork 0
Code Issues 5 Pull requests 1 Projects 1 Releases Packages Wiki Activity Actions

Compare commits

base: Mineplay:fc3597fca58868a1f4a422257759ed7f454108af
Branches Tags
Mineplay:main
Mineplay:f11-red-black-tree
...
compare: Mineplay:2a265f75ae332fc8febc876e132ce63a0a7aac65
Branches Tags
Mineplay:f11-red-black-tree
Mineplay:main

2 commits
fc3597fca5 ... 2a265f75ae

Author SHA1 Message Date
Mineplay
2a265f75ae feat(red black tree): implemented is empty function 2025-09-07 11:53:49 -05:00
Mineplay
b1136f78d8 feat(red black tree): implemented free function 2025-09-07 11:51:17 -05:00
2 changed files with 60 additions and 14 deletions
Show stats Expand all files Collapse all files

69
Include/Fledasty/Trees/RedBlackTree.h
View file

@ -33,19 +33,60 @@
#include "../Utils/Error.h"
#define FLEDASTY_RED_BLACK_TREE_DEFINE(key_type, value_type, name) \
typedef struct FledastyRedBlackTreeNode_##name { \
bool is_red; \
\
key_type key; \
value_type value; \
\
struct FledastyRedBlackTreeNode_##name *parent, *left, *right; \
} FledastyRedBlackTreeNode_##name; \
\
typedef struct { \
size_t size; \
FledastyRedBlackTreeNode_##name *top; \
} FledastyRedBlackTree_##name;
#define FLEDASTY_RED_BLACK_TREE_DEFINE(key_type, value_type, name) \
typedef struct FledastyRedBlackTreeNode_##name { \
bool is_red; \
\
key_type key; \
value_type value; \
\
struct FledastyRedBlackTreeNode_##name *parent, *left, *right; \
} FledastyRedBlackTreeNode_##name; \
\
typedef struct { \
size_t size; \
FledastyRedBlackTreeNode_##name *top; \
} FledastyRedBlackTree_##name; \
\
FledastyError fledasty_red_black_tree_##name##_free(FledastyRedBlackTree_##name *current_red_black_tree); \
\
static inline bool fledasty_red_black_tree_##name##_is_empty(const FledastyRedBlackTree_##name *current_red_black_tree) { return current_red_black_tree == NULL || current_red_black_tree->size == 0; }
#define FLEDASTY_RED_BLACK_TREE_IMPLEMENT(key_type, value_type, name, compare_key_function, key_less_than_function) \
FledastyError fledasty_red_black_tree_##name##_free(FledastyRedBlackTree_##name *current_red_black_tree) { \
if (current_red_black_tree != NULL) { \
return FLEDASTY_ERROR_INVALID_POINTER; \
} \
\
FledastyRedBlackTreeNode_##name *current_node = current_red_black_tree->top; \
while (current_node != NULL) { \
if (current_node->left != NULL) { \
current_node = current_node->left; \
} else if (current_node->right != NULL) { \
current_node = current_node->right; \
} else if (current_node->parent != NULL) { \
current_node = current_node->parent; \
if (current_node->left != NULL) { \
if (hallocy_free(current_node->left) != HALLOCY_ERROR_NONE) { \
return FLEDASTY_ERROR_FAILED_ALLOCATION; \
} \
\
current_node->left = NULL; \
} else { \
if (hallocy_free(current_node->right) != HALLOCY_ERROR_NONE) { \
return FLEDASTY_ERROR_FAILED_ALLOCATION; \
} \
\
current_node->right = NULL; \
} \
} else { \
hallocy_free(current_node); \
current_node = NULL; \
} \
} \
\
return FLEDASTY_ERROR_NONE; \
}
#endif

5
Tests/Main.c
View file

@ -60,6 +60,7 @@ FLEDASTY_BINARY_SEARCH_TREE_DEFINE(int, int, int_int)
FLEDASTY_BINARY_SEARCH_TREE_IMPLEMENT(int, int, int_int, compare_integers, integer_less_than_integer)
FLEDASTY_RED_BLACK_TREE_DEFINE(int, int, int_int)
FLEDASTY_RED_BLACK_TREE_IMPLEMENT(int, int, int_int, compare_integers, integer_less_than_integer)
int main() {
FledastyQueue_int test_queue = { 0, 0, 0, 0, NULL };
@ -381,6 +382,10 @@ int main() {
printf("Biggest key is %d with the value %d\n", max_key, max_value);
fledasty_binary_search_tree_int_int_free(&test_search_tree);
FledastyRedBlackTree_int_int test_red_black_tree = { 0, NULL };
fledasty_red_black_tree_int_int_free(&test_red_black_tree);
printf("Done\n");
return 0;
}