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

perf(search tree): improved insertion and replacement performance

Browse source
This commit is contained in:
Mineplay 2025-08-31 08:26:14 -05:00
parent 86acb0560a
commit 1d8550d653
1 changed files with 24 additions and 29 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

53
Include/Fledasty/Trees/BinarySearchTree.h
View file

@ -95,45 +95,40 @@ FledastyError fledasty_binary_search_tree_##name##_insert(FledastyBinarySearchTr
return FLEDASTY_ERROR_INVALID_POINTER; \
} \
\
FledastyBinarySearchTreeNode_##name *new_node = (FledastyBinarySearchTreeNode_##name*)hallocy_malloc(sizeof(FledastyBinarySearchTreeNode_##name)); \
if (new_node == NULL) { \
return FLEDASTY_ERROR_FAILED_ALLOCATION; \
FledastyBinarySearchTreeNode_##name *previous_node = NULL; \
FledastyBinarySearchTreeNode_##name *current_node = current_binary_search_tree->top; \
while (current_node != NULL) { \
if (compare_key_function(key, current_node->key)) { \
current_node->value = value; \
return FLEDASTY_ERROR_VALUE_REPLACED; \
} \
\
previous_node = current_node; \
if (key_less_than_function(key, current_node->key)) { \
current_node = previous_node->left; \
} else { \
current_node = previous_node->right; \
} \
} \
\
FledastyBinarySearchTreeNode_##name *new_node = (FledastyBinarySearchTreeNode_##name*)hallocy_malloc(sizeof(FledastyBinarySearchTreeNode_##name)); \
if (new_node == NULL) { \
return FLEDASTY_ERROR_FAILED_ALLOCATION; \
} \
\
new_node->parent = previous_node; \
new_node->left = NULL; \
new_node->right = NULL; \
new_node->parent = NULL; \
\
new_node->key = key; \
new_node->value = value; \
\
if (current_binary_search_tree->top == NULL) { \
if (previous_node == NULL) { \
current_binary_search_tree->top = new_node; \
} else if (key_less_than_function(key, previous_node->key)) { \
previous_node->left = new_node; \
} else { \
FledastyBinarySearchTreeNode_##name *current_node = current_binary_search_tree->top; \
while (new_node->parent == NULL) { \
if (compare_key_function(key, current_node->key)) { \
current_node->value = value; \
hallocy_free(new_node); \
return FLEDASTY_ERROR_VALUE_REPLACED; \
} \
\
if (key_less_than_function(key, current_node->key)) { \
if (current_node->left == NULL) { \
new_node->parent = current_node; \
current_node->left = new_node; \
} else { \
current_node = current_node->left; \
} \
} else { \
if (current_node->right == NULL) { \
new_node->parent = current_node; \
current_node->right = new_node; \
} else { \
current_node = current_node->right; \
} \
} \
} \
previous_node->right = new_node; \
} \
\
current_binary_search_tree->size += 1; \