Imbus/CTree
1
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Formatting

Browse source
This commit is contained in:
Imbus 2024-03-27 06:40:47 +01:00
parent c49f02d8d7
commit 5b7efc9ef3
3 changed files with 62 additions and 65 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

21
src/tree.c
View file

@ -20,11 +20,12 @@ int tree_insert(Tree *tree, int data) {
// An iterative (non-recursive approach) to tree insertion // An iterative (non-recursive approach) to tree insertion
// While we look for a place to put our new node // While we look for a place to put our new node
while(1) { while (1) {
// If larger than data // If larger than data
if(new_node->data > cursor->data) { if (new_node->data > cursor->data) {
// If there is a child to the right // If there is a child to the right
if(cursor->right != NULL) cursor = cursor->right; if (cursor->right != NULL)
cursor = cursor->right;
else { else {
cursor->right = new_node; // Put our node here cursor->right = new_node; // Put our node here
break; // Break the outer while loop break; // Break the outer while loop
@ -32,25 +33,21 @@ int tree_insert(Tree *tree, int data) {
} }
// If less-or-equal than our data // If less-or-equal than our data
if(new_node->data <= cursor->data) { if (new_node->data <= cursor->data) {
// If there is a child to the left // If there is a child to the left
if(cursor->left != NULL) cursor = cursor->left; if (cursor->left != NULL)
cursor = cursor->left;
else { else {
cursor->left = new_node; // Put our node here cursor->left = new_node; // Put our node here
break; // Break the outer while loop break; // Break the outer while loop
} }
} }
} }
} }
int tree_remove(Tree *tree, int data) { int tree_remove(Tree *tree, int data) { return 1; }
return 1;
}
int tree_clear(Tree *tree) { int tree_clear(Tree *tree) { return 1; }
return 1;
}
int tree_size(Tree *tree) { int tree_size(Tree *tree) {
if (tree->root == NULL) { if (tree->root == NULL) {