OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

fix: remove memory leak by adding deleteAllNodes

Browse Source
This commit is contained in:
piotr.idzik 2023-01-27 22:44:25 +01:00
parent 7c090481da
commit 9d76f8bd7f
1 changed files with 11 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
data_structures/avltree.cpp
View File

@ -64,9 +64,8 @@ node *minValue(node *root) {
/** Balanced Insertion */ /** Balanced Insertion */
node *insert(node *root, int item) { node *insert(node *root, int item) {
node *nn = createNode(item);
if (root == NULL) if (root == NULL)
return nn; return createNode(item);
if (item < root->data) if (item < root->data)
root->left = insert(root->left, item); root->left = insert(root->left, item);
else else
@ -115,6 +114,15 @@ node *deleteNode(node *root, int key) {
return root; return root;
} }
/** Calls delete on every node */
void deleteAllNodes(const node *const root) {
if (root) {
deleteAllNodes(root->left);
deleteAllNodes(root->right);
delete root;
}
}
/** LevelOrder (Breadth First Search) */ /** LevelOrder (Breadth First Search) */
void levelOrder(node *root) { void levelOrder(node *root) {
std::queue<node *> q; std::queue<node *> q;
@ -144,5 +152,6 @@ int main() {
root = deleteNode(root, 4); // Deletin key with value 4 root = deleteNode(root, 4); // Deletin key with value 4
std::cout << "\nLevelOrder: "; std::cout << "\nLevelOrder: ";
levelOrder(root); levelOrder(root);
deleteAllNodes(root);
return 0; return 0;
} }