backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-02-10 14:05:17 +08:00
Code Issues Projects Releases Wiki Activity

style: simplify logic in deleteNode

Browse Source
This commit is contained in:
piotr.idzik
2023-01-31 20:54:06 +01:00
parent 649154a68f
commit 93ab3e9f51
1 changed files with 9 additions and 15 deletions
Download Patch File Download Diff File Expand all files Collapse all files

24
data_structures/avltree.cpp
View File

@@ -116,29 +116,23 @@ node *insert(node *root, int item) {
/**
* @brief removes a given element from AVL tree
* @param root of the tree
* @param[in] key the element to be deleted from the tree
* @param[in] element the element to be deleted from the tree
* @return root of the updated tree
*/
node *deleteNode(node *root, int key) {
node *deleteNode(node *root, int element) {
if (root == nullptr) {
return root;
}
if (key < root->data) {
root->left = deleteNode(root->left, key);
} else if (key > root->data) {
root->right = deleteNode(root->right, key);
if (element < root->data) {
root->left = deleteNode(root->left, element);
} else if (element > root->data) {
root->right = deleteNode(root->right, element);
} else {
// Node to be deleted is leaf node or have only one Child
if (!root->right) {
node *temp = root->left;
delete (root);
root = nullptr;
return temp;
} else if (!root->left) {
node *temp = root->right;
delete (root);
root = nullptr;
if (!root->right || !root->left) {
node *temp = !root->right ? root->left : root->right;
delete root;
return temp;
}
// Node to be deleted have both left and right subtrees