mirrors/TheAlgorithms-C
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C synced 2025-04-17 19:03:15 +03:00
Code Issues Packages Projects Releases Wiki Activity

Update binary_search_tree.c

Browse Source
This commit is contained in:
Ruslan Pseush 2024-09-01 18:05:45 +03:00 committed by GitHub
parent e5dad3fa8d
commit 7a6e65ef1d
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 9 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
data_structures/binary_trees/binary_search_tree.c
View File

@ -25,7 +25,7 @@ typedef struct node
* @note the node must be deleted before program terminates to avoid memory
* leaks
*/
node *newNode(int data)
void newNode(node **root, int data)
{
// creates a slug
node *tmp = (node *)malloc(sizeof(node));
@ -34,8 +34,8 @@ node *newNode(int data)
tmp->data = data;
tmp->left = NULL;
tmp->right = NULL;
root[0] = tmp;
return tmp;
}
/** Insertion procedure, which inserts the input key in a new node in the tree
@ -43,26 +43,24 @@ node *newNode(int data)
* @param data value to store int he new node
* @returns pointer to parent node
*/
node *insert(node *root, int data)
void insert(node *root, int data)
{
// If the root of the subtree is null, insert key here
if (root == NULL)
if ((*root) == NULL)
{
root = newNode(data);
newNode(data);
}
else if (data > root->data)
else if (data > (*root)->data)
{
// If it isn't null and the input key is greater than the root key,
// insert in the right leaf
root->right = insert(root->right, data);
insert((&(*root)->right), data);
}
else if (data < root->data)
else if (data < (*root)->data)
{ // If it isn't null and the input key is lower than the root key, insert
// in the left leaf
root->left = insert(root->left, data);
insert((&(*root)->left), data);
}
// Returns the modified tree
return root;
}
/** Utilitary procedure to find the greatest key in the left subtree