mu590ku/pvjc24
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

rwerw

Browse Source
This commit is contained in:
Michal Utľák 2024-04-23 19:53:07 +02:00
parent 2a72097c20
commit f644616cc4
1 changed files with 11 additions and 19 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

30
a3/binary_search_tree.c
View File

@ -30,29 +30,21 @@ int *sorted_data(node_t *tree) {
return NULL;
}
size_t index = 0;
node_t *current_node = tree;
while (current_node != NULL) {
if (current_node->left == NULL) {
sorted_array[index++] = current_node->data;
current_node = current_node->right;
} else {
node_t *predecessor = current_node->left;
while (predecessor->right != NULL && predecessor->right != current_node) {
predecessor = predecessor->right;
}
node_t *stack[num_nodes];
size_t stack_top = 0;
if (predecessor->right == NULL) {
predecessor->right = current_node;
current_node = current_node->left;
} else {
predecessor->right = NULL;
sorted_array[index++] = current_node->data;
current_node = current_node->right;
}
while (tree != NULL || stack_top > 0) {
while (tree != NULL) {
stack[stack_top++] = tree;
tree = tree->left;
}
tree = stack[--stack_top];
sorted_array[index++] = tree->data;
tree = tree->right;
}
return sorted_array;