chore: use iwyu on data_structures/**.cpp

Author: realstealthninja

data_structures/binary_search_tree.cpp

@@ -6,7 +6,8 @@
  * \warning This program is a poor implementation - C style - and does not
  * utilize any of the C++ STL features.
  */
-#include <iostream>
+#include <cstddef>   // for NULL
+#include <iostream>  // for operator<<, basic_ostream, char_traits, cout
 
 struct node {
     int val;
@@ -145,28 +146,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,11 +5,13 @@
  * @see binary_search_tree.cpp
  */
 
-#include <cassert>
-#include <functional>
-#include <iostream>
-#include <memory>
-#include <vector>
+#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
 
 /**
  * @brief The Binary Search Tree class.

data_structures/bloom_filter.cpp

@@ -22,12 +22,13 @@
  * @author [DanArmor](https://github.com/DanArmor)
  */
 
-#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
+#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
 
 /**
  * @namespace data_structures

data_structures/cll/cll.cpp

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

data_structures/doubly_linked_list.cpp

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

data_structures/dsu_path_compression.cpp

@@ -18,10 +18,12 @@
  * @see dsu_union_rank.cpp
  */
 
-#include <cassert>   /// for assert
-#include <cstdint>   /// for integral typedefs
-#include <iostream>  /// for IO operations
-#include <vector>    /// for std::vector
+#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
 
 using std::cout;
 using std::endl;

data_structures/dsu_union_rank.cpp

@@ -19,10 +19,11 @@
  * @see dsu_path_compression.cpp
  */
 
-#include <cassert>   /// for assert
-#include <cstdint>   /// for integral typedefs
-#include <iostream>  /// for IO operations
-#include <vector>    /// for std::vector
+#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
 
 using std::cout;
 using std::endl;

data_structures/linked_list.cpp

@@ -14,9 +14,10 @@
  * to point to the node that the current node is pointing to, and then returning
  * the current node to heap store.
  */
-#include <iostream>
-#include <memory>
-#include <string>
+#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
 
 /**
  * @namespace data_structures

data_structures/list_array.cpp

@@ -14,10 +14,11 @@
  * and print the list.
  */
 
-#include <array>     /// for std::array
-#include <cassert>   /// for assert
-#include <cstdint>   /// for integral typedefs
-#include <iostream>  /// for io operations
+#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
 
 /**
  * @namespace data_structures

data_structures/morrisinorder.cpp

@@ -1,5 +1,6 @@
-#include <iostream>
-#include <queue>
+#include <cstddef>   // for NULL
+#include <iostream>  // for char_traits, operator<<, basic_ostream, basic_os...
+#include <queue>     // for queue
 
 /**************************
     @author shrutisheoran

data_structures/queue_using_array.cpp

@@ -17,9 +17,10 @@
  * @author [Pooja](https://github.com/pooja-git11)
  * @author [Farbod Ahmadian](https://github.com/farbodahm)
  */
-#include <array>     /// for std::array
-#include <cstdint>   /// for integral typedefs
-#include <iostream>  /// for io operations
+#include <stdlib.h>  // for exit
+#include <array>     // for array
+#include <cstdint>   // for int16_t, int8_t, uint16_t
+#include <iostream>  // for operator<<, basic_ostream, cout, char_traits
 
 constexpr uint16_t max_size{10};  ///< Maximum size of the queue
 

data_structures/queue_using_linked_list.cpp

@@ -1,4 +1,6 @@
-#include <iostream>
+#include <cstddef>   // for NULL
+#include <iostream>  // for operator<<, basic_ostream, char_traits, cout
+
 using namespace std;
 
 struct node {

data_structures/queue_using_linkedlist.cpp

@@ -1,7 +1,8 @@
 /*
     Write a program to implement Queue using linkedlist.
 */
-#include <iostream>
+#include <stdlib.h>  // for NULL, exit
+#include <iostream>  // for operator<<, basic_ostream, cout, char_traits
 
 struct linkedlist {
     int data;

data_structures/queue_using_two_stacks.cpp

@@ -5,9 +5,10 @@
  * Implementation of a Queue using two Stacks.
  */
 
-#include <cassert>
-#include <iostream>
-#include <stack>
+#include <stdlib.h>  // for exit
+#include <cassert>   // for assert
+#include <iostream>  // for operator<<, basic_ostream, char_traits, cout, cerr
+#include <stack>     // for stack
 
 namespace {
 /**