Revert "chore: use iwyu on data_structures/**.cpp"

This reverts commit a3b719e.

Author: realstealthninja

data_structures/binary_search_tree.cpp

@@ -6,8 +6,7 @@
  * \warning This program is a poor implementation - C style - and does not
  * utilize any of the C++ STL features.
  */
-#include <cstddef>   // for NULL
-#include <iostream>  // for operator<<, basic_ostream, char_traits, cout
+#include <iostream>
 
 struct node {
     int val;
@@ -146,28 +145,28 @@ int main() {
         std::cin >> ch;
         int x;
         switch (ch) {
-            case 1:
-                std::cout << "\nEnter the value to be Inserted : ";
-                std::cin >> x;
-                Insert(root, x);
-                break;
-            case 2:
-                std::cout << "\nEnter the value to be Deleted : ";
-                std::cin >> x;
-                Remove(root, root, x);
-                break;
-            case 3:
-                BFT(root);
-                break;
-            case 4:
-                Pre(root);
-                break;
-            case 5:
-                In(root);
-                break;
-            case 6:
-                Post(root);
-                break;
+        case 1:
+            std::cout << "\nEnter the value to be Inserted : ";
+            std::cin >> x;
+            Insert(root, x);
+            break;
+        case 2:
+            std::cout << "\nEnter the value to be Deleted : ";
+            std::cin >> x;
+            Remove(root, root, x);
+            break;
+        case 3:
+            BFT(root);
+            break;
+        case 4:
+            Pre(root);
+            break;
+        case 5:
+            In(root);
+            break;
+        case 6:
+            Post(root);
+            break;
         }
     } while (ch != 0);
 

data_structures/binary_search_tree2.cpp

@@ -5,13 +5,11 @@
  * @see binary_search_tree.cpp
  */
 
-#include <cassert>     // for assert
-#include <functional>  // for function
-#include <iostream>    // for basic_ostream, operator<<, cout, char_traits
-#include <memory>      // for operator==, unique_ptr, allocator
-#include <vector>      // for vector, operator==
-#include <cstddef>     // for size_t
-#include <utility>     // for move
+#include <cassert>
+#include <functional>
+#include <iostream>
+#include <memory>
+#include <vector>
 
 /**
  * @brief The Binary Search Tree class.

data_structures/bloom_filter.cpp

@@ -22,13 +22,12 @@
  * @author [DanArmor](https://github.com/DanArmor)
  */
 
-#include <cassert>           // for assert
-#include <functional>        // for function
-#include <initializer_list>  // for initializer_list
-#include <string>            // for basic_string, string
-#include <vector>            // for vector
-#include <iostream>          // for operator<<, basic_ostream, cout
-#include <cstddef>           // for size_t
+#include <cassert>           /// for assert
+#include <functional>        /// for list of hash functions for bloom filter constructor
+#include <initializer_list>  /// for initializer_list for bloom filter constructor
+#include <string>            /// for testing on strings
+#include <vector>            /// for std::vector
+#include <iostream>          /// for IO operations
 
 /**
  * @namespace data_structures

data_structures/cll/cll.cpp

@@ -2,10 +2,6 @@
     A simple class for Cicular Linear Linked List
 */
 #include "cll.h"
-
-#include <cstdlib>   // for NULL
-#include <iostream>  // for basic_ostream, char_traits, operator<<, cout
-
 using namespace std;
 
 /* Constructor */

data_structures/cll/main_cll.cpp

@@ -1,7 +1,4 @@
-#include <iostream>  // for basic_ostream, operator<<, char_traits, cout, endl
-
-#include "cll.h"     // for cll
-
+#include "cll.h"
 using namespace std;
 
 int main() {

data_structures/doubly_linked_list.cpp

@@ -1,5 +1,6 @@
-#include <cstdio>    // for NULL
-#include <iostream>  // for operator<<, basic_ostream, cout, char_traits
+#include <cstdio>
+#include <cstdlib>
+#include <iostream>
 
 struct node {
     int val;

data_structures/dsu_path_compression.cpp

@@ -18,12 +18,10 @@
  * @see dsu_union_rank.cpp
  */
 
-#include <cassert>    // for assert
-#include <cstdint>    // for uint64_t
-#include <iostream>   // for char_traits, basic_ostream, operator<<, cout, endl
-#include <vector>     // for vector
-#include <algorithm>  // for max, min
-#include <utility>    // for swap
+#include <cassert>   /// for assert
+#include <cstdint>   /// for integral typedefs
+#include <iostream>  /// for IO operations
+#include <vector>    /// for std::vector
 
 using std::cout;
 using std::endl;

data_structures/dsu_union_rank.cpp

@@ -19,11 +19,10 @@
  * @see dsu_path_compression.cpp
  */
 
-#include <cassert>   // for assert
-#include <cstdint>   // for uint64_t
-#include <iostream>  // for char_traits, basic_ostream, operator<<, cout, endl
-#include <vector>    // for vector
-#include <utility>   // for swap
+#include <cassert>   /// for assert
+#include <cstdint>   /// for integral typedefs
+#include <iostream>  /// for IO operations
+#include <vector>    /// for std::vector
 
 using std::cout;
 using std::endl;

data_structures/linked_list.cpp

@@ -14,10 +14,9 @@
  * to point to the node that the current node is pointing to, and then returning
  * the current node to heap store.
  */
-#include <ctype.h>   // for isdigit
-#include <iostream>  // for operator<<, basic_ostream, cout, basic_istream, cin
-#include <memory>    // for shared_ptr, __shared_ptr_access, make_shared
-#include <string>    // for char_traits, basic_string, operator>>, stoi, string
+#include <iostream>
+#include <memory>
+#include <string>
 
 /**
  * @namespace data_structures

data_structures/list_array.cpp

@@ -14,11 +14,10 @@
  * and print the list.
  */
 
-#include <array>     // for array
-#include <cassert>   // for assert
-#include <cstdint>   // for uint64_t
-#include <iostream>  // for operator<<, basic_ostream::operator<<, basic_ost...
-#include <utility>   // for swap
+#include <array>     /// for std::array
+#include <cassert>   /// for assert
+#include <cstdint>   /// for integral typedefs
+#include <iostream>  /// for io operations
 
 /**
  * @namespace data_structures