OpenSoure_Repos/TheAlgorithms-C
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/TheAlgorithms/C.git synced 2023-10-11 15:56:24 +08:00
Code Issues Packages Projects Releases Wiki Activity

docs: fix minor typos in data_structures/avl_tree.c (#1218)

Browse Source
This commit is contained in:
wtz 2023-02-21 06:19:47 +08:00 committed by GitHub
parent 2d505ccf13
commit 521db035ca
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
data_structures/binary_trees/avl_tree.c
View File

@ -169,12 +169,12 @@ avlNode *delete (avlNode *node, int queryNum)
delete (node->right, queryNum); /*Recursive deletion in R subtree*/ delete (node->right, queryNum); /*Recursive deletion in R subtree*/
else else
{ {
/*Single or No Child*/ /*Single or No Children*/
if ((node->left == NULL) || (node->right == NULL)) if ((node->left == NULL) || (node->right == NULL))
{ {
avlNode *temp = node->left ? node->left : node->right; avlNode *temp = node->left ? node->left : node->right;
/* No Child*/ /* No Children*/
if (temp == NULL) if (temp == NULL)
{ {
temp = node; temp = node;
@ -187,7 +187,7 @@ avlNode *delete (avlNode *node, int queryNum)
} }
else else
{ {
/*Two Child*/ /*Two Children*/
/*Get the smallest key in the R subtree*/ /*Get the smallest key in the R subtree*/
avlNode *temp = minNode(node->right); avlNode *temp = minNode(node->right);