Merge branch 'master' into fix/2509-added-test-case

Author: realstealthninja

data_structures/morrisinorder.cpp

@@ -81,12 +81,21 @@ void morrisInorder(Btree *root) {
     }
 }
 
+void deleteAll(const Btree *const root) {
+    if (root) {
+        deleteAll(root->left);
+        deleteAll(root->right);
+        delete root;
+    }
+}
+
 int main() {
     // Testing morrisInorder funtion
     Btree *root = NULL;
     int i;
     for (i = 1; i <= 7; i++) insert(&root, i);
     cout << "Morris Inorder: ";
     morrisInorder(root);
+    deleteAll(root);
     return 0;
 }

greedy_algorithms/huffman.cpp

@@ -23,6 +23,14 @@ struct MinHeapNode {
     }
 };
 
+void deleteAll(const MinHeapNode* const root) {
+    if (root) {
+        deleteAll(root->left);
+        deleteAll(root->right);
+        delete root;
+    }
+}
+
 // For comparison of
 // two heap nodes (needed in min heap)
 struct compare {
@@ -85,6 +93,7 @@ void HuffmanCodes(char data[], int freq[], int size) {
     // Print Huffman codes using
     // the Huffman tree built above
     printCodes(minHeap.top(), "");
+    deleteAll(minHeap.top());
 }
 
 // Driver program to test above functions

operations_on_datastructures/reverse_binary_tree.cpp

@@ -91,6 +91,9 @@ class BinaryTree {
         return pivot;
     }
 
+    BinaryTree(const BinaryTree&) = delete;
+    BinaryTree& operator=(const BinaryTree&) = delete;
+
  public:
     /**
      * @brief Creates a BinaryTree with a root pointing to NULL.
@@ -100,6 +103,21 @@ class BinaryTree {
      * @brief Creates a BinaryTree with a root with an initial value.
      */
     explicit BinaryTree(int64_t data) { root = new Node(data); }
+
+    ~BinaryTree() {
+        std::vector<Node*> nodes;
+        nodes.emplace_back(root);
+        while (!nodes.empty()) {
+            const auto cur_node = nodes.back();
+            nodes.pop_back();
+            if (cur_node) {
+                nodes.emplace_back(cur_node->left);
+                nodes.emplace_back(cur_node->right);
+                delete cur_node;
+            }
+        }
+    }
+
     /**
      * @brief Adds a new Node to the Binary Tree
      */