backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-02-12 23:15:52 +08:00
Code Issues Projects Releases Wiki Activity

memory leaks patched

Browse Source
This commit is contained in:
foo290
2021-07-17 21:19:49 +05:30
parent f1b8319824
commit e4e3ec98ba
1 changed files with 21 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

30
operations_on_datastructures/inorder_successor_of_bst.cpp
View File

@@ -194,9 +194,25 @@ namespace operations_on_datastructures {
return successor; // Nodes with maximum vales will not have a successor
}
}
} // namespace inorder_traversal_of_bst
/**
* @brief This function clears the memory allocated to entire tree recursively. Its just for clean up the
* memory and not relevant to the actual topic.
* @param root Root node of the tree.
* @returns void
* */
void deallocate (Node* rootNode){
if (rootNode == nullptr) return;
deallocate(rootNode->left);
deallocate(rootNode->right);
delete(rootNode);
}
} // namespace inorder_traversal_of_bst
} // namespace operations_on_datastructures
/**
* @brief class encapsulating the necessary test cases
*/
@@ -267,8 +283,7 @@ public:
assert(inorderSuccessor == expectedOutput);
log("Assertion check passed!");
delete (inorderSuccessor);
delete (root);
operations_on_datastructures::inorder_traversal_of_bst::deallocate(root); /// memory cleanup!
log("[PASS] : TEST CASE 1 PASS!");
log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~");
@@ -308,8 +323,7 @@ public:
assert(inorderSuccessor->data == expectedOutput);
log("Assertion check passed!");
delete (inorderSuccessor);
delete (root);
operations_on_datastructures::inorder_traversal_of_bst::deallocate(root); /// memory cleanup!
log("[PASS] : TEST CASE 2 PASS!");
log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~");
@@ -350,8 +364,7 @@ public:
assert(inorderSuccessor->data == expectedOutput);
log("Assertion check passed!");
delete (inorderSuccessor);
delete (root);
operations_on_datastructures::inorder_traversal_of_bst::deallocate(root); /// memory cleanup!
log("[PASS] : TEST CASE 3 PASS!");
log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~");
@@ -401,8 +414,7 @@ int main(int argc, char *argv[]) {
<< inorderSuccessor->data;
}
delete (inorderSuccessor);
delete (root);
deallocate(root); /// memory cleanup!
return 0;
}