fix: Various CI fixes

Author: Panquesito7

backtracking/graph_coloring.cpp

@@ -13,10 +13,11 @@ void printSolution(int color[]);
 /* A utility function to check if the current color assignment
    is safe for vertex v */
 bool isSafe(int v, bool graph[V][V], int color[], int c) {
-    for (int i = 0; i < V; i++)
+    for (int i = 0; i < V; i++) {
         if (graph[v][i] && c == color[i]) {
             return false;
         }
+    }
     return true;
 }
 
@@ -73,7 +74,9 @@ int main() {
 
     int color[V];
 
-    for (int i = 0; i < V; i++) { color[i] = 0 };
+    for (int i = 0; i < V; i++) { 
+        color[i] = 0;
+    }
 
     graphColoring(graph, m, color, 0);
     return 0;

backtracking/knight_tour.cpp

@@ -57,7 +57,9 @@ int main() {
         cout << "solution doesnot exist \n";
     } else {
         for (i = 0; i < n; i++) {
-            for (j = 0; j < n; j++) { cout << sol[i][j] << "  " };
+            for (j = 0; j < n; j++) { 
+                cout << sol[i][j] << "  ";
+            }
             cout << "\n";
         }
     }

data_structures/doubly_linked_list.cpp

@@ -156,7 +156,7 @@ int main() {
             break;
 
         default:
-            if (choice == 0) { return }
+            if (choice == 0) { break; }
             std::cout << "Wrong option; type an option : ";
             std::cin >> choice;
 

data_structures/linked_list.cpp

@@ -151,7 +151,7 @@ int main() {
             break;
 
         default:
-            if (choice == 0) { return }
+            if (choice == 0) { break; }
             std::cout << "Wrong option; type an option : ";
             std::cin >> choice;
 

data_structures/list_array.cpp

@@ -156,7 +156,7 @@ int main() {
             break;
 
         default:
-            if (choice == 0) { return }
+            if (choice == 0) { break; }
             std::cout << "Wrong option; type an option : ";
             std::cin >> choice;
 

data_structures/morrisinorder.cpp

@@ -20,7 +20,8 @@ void insert(Btree **root, int d) {
         *root = nn;
         return;
     } else {
-        queue<Btree *> q;
+        std::queue<Btree *> q;
+
         // Adding root node to queue
         q.push(*root);
         while (!q.empty()) {
@@ -59,7 +60,7 @@ void morrisInorder(Btree *root) {
             // Left of current node is stored in temp
             temp = curr->left;
             // Moving to extreme right of temp
-            while (temp->right && temp->right != curr) { temp = temp->right };
+            while (temp->right && temp->right != curr) { temp = temp->right; }
             // If extreme right is null it is made to point to currrent node
             // (will be used for backtracking)
             if (temp->right == nullptr) {
@@ -85,7 +86,9 @@ int main() {
     // Testing morrisInorder funtion
     Btree *root = nullptr;
     int i;
-    for (i = 1; i <= 7; i++) { insert(&root, i) };
+    for (i = 1; i <= 7; i++) { 
+        insert(&root, i);
+    }
     std::cout << "Morris Inorder: ";
     morrisInorder(root);
     return 0;

data_structures/queue_using_array2.cpp

@@ -6,7 +6,7 @@ int rear = 0;
 
 void Enque(int x) {
     if (rear == 10) {
-        cout << "\nOverflow";
+        std::cout << "\nOverflow";
     } else {
         queue[rear++] = x;
     }
@@ -15,9 +15,8 @@ void Enque(int x) {
 void Deque() {
     if (front == rear) {
         std::cout << "\nUnderflow";
-    }
 
-    else {
+    } else {
         std::cout << "\n" << queue[front++] << " deleted";
         for (int i = front; i < rear; i++) {
             queue[i - front] = queue[i];
@@ -43,8 +42,8 @@ int main() {
         std::cout << "\nEnter Your Choice : ";
         std::cin >> ch;
         if (ch == 1) {
-            cout << "\nInsert : ";
-            cin >> x;
+            std::cout << "\nInsert : ";
+            std::cin >> x;
             Enque(x);
         } else if (ch == 2) {
             Deque();

data_structures/queue_using_linked_list.cpp

@@ -14,9 +14,8 @@ void Enque(int x) {
         n->next = nullptr;
         rear = n;
         front = n;
-    }
 
-    else {
+    } else {
         node *n = new node;
         n->val = x;
         n->next = nullptr;
@@ -58,7 +57,7 @@ int main() {
         std::cin >> ch;
         if (ch == 1) {
             std::cout << "\nInsert : ";
-            std:::cin >> x;
+            std::cin >> x;
             Enque(x);
         } else if (ch == 2) {
             Deque();

data_structures/stack_using_linked_list.cpp

@@ -1,5 +1,4 @@
 #include <iostream>
-using namespace std;
 
 struct node {
     int val;
@@ -16,35 +15,36 @@ void push(int x) {
 }
 
 void pop() {
-    if (top == NULL) {
-        cout << "\nUnderflow";
+    if (top == nullptr) {
+        std::cout << "\nUnderflow";
     } else {
         node *t = top;
-        cout << "\n" << t->val << " deleted";
+        std::cout << "\n" << t->val << " deleted";
         top = top->next;
         delete t;
     }
 }
 
 void show() {
     node *t = top;
-    while (t != NULL) {
-        cout << t->val << "\n";
+    while (t != nullptr) {
+        std::cout << t->val << "\n";
         t = t->next;
     }
 }
 
 int main() {
     int ch, x;
     do {
-        cout << "\n1. Push";
-        cout << "\n2. Pop";
-        cout << "\n3. Print";
-        cout << "\nEnter Your Choice : ";
-        cin >> ch;
+        std::cout << "\n0. Exit";
+        std::cout << "\n1. Push";
+        std::cout << "\n2. Pop";
+        std::cout << "\n3. Print";
+        std::cout << "\nEnter Your Choice : ";
+        std::cin >> ch;
         if (ch == 1) {
-            cout << "\nInsert : ";
-            cin >> x;
+            std::cout << "\nInsert : ";
+            std::cin >> x;
             push(x);
         } else if (ch == 2) {
             pop();

data_structures/tree.cpp

@@ -37,7 +37,7 @@ void CreateTree(node *curr, node *n, int x, char pos) {
 }
 
 void BFT(node *n) {
-    list<node *> queue;
+    std::list<node *> queue;
 
     queue.push_back(n);
 
@@ -123,12 +123,14 @@ int main() {
             break;
 
         default:
-            if (ch == 0) { return }
+            if (ch == 0) { break; }
             std::cout << "Wrong option; type an option : ";
             std::cin >> ch;
 
             break;
         }
     } while (ch != 0);
+
+    delete root;
     return 0;
 }

data_structures/trie_tree.cpp

@@ -17,7 +17,7 @@ typedef struct trie {
  */
 trie* createNode() {
     trie* nn = new trie();
-    for (int i = 0; i < 26; i++) { nn->arr[i] = nullptr };
+    for (int i = 0; i < 26; i++) { nn->arr[i] = nullptr; }
     nn->isEndofWord = false;
     return nn;
 }
@@ -66,7 +66,7 @@ bool deleteString(trie* root, std::string str, int index) {
             return false;
         }
         root->isEndofWord = false;
-        for (int i = 0; i < 26; i++) { return false };
+        for (int i = 0; i < 26; i++) { return false; }
         return true;
     }
     int j = str[index] - 'a';
@@ -106,7 +106,5 @@ int main() {
     int b = search(root, "word", 0);
 
     std::cout << a << b;
-    delete trie;
-
     return 0;
 }