From 8e2209310efea62707023c9f68463d3f04fe9640 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Ahmet=20Kaan=20G=C3=9CM=C3=9C=C5=9E?=
 <96421894+Tahinli@users.noreply.github.com>
Date: Sun, 23 Jun 2024 22:20:44 +0300
Subject: [PATCH] revert: :rewind: linked list shouldn't be here

---
 Linked List in C/main.c | 115 ----------------------------------------
 1 file changed, 115 deletions(-)
 delete mode 100644 Linked List in C/main.c

diff --git a/Linked List in C/main.c b/Linked List in C/main.c
deleted file mode 100644
index 4b93b4b..0000000
--- a/Linked List in C/main.c	
+++ /dev/null
@@ -1,115 +0,0 @@
-#include <stdlib.h>
-#include <stdio.h>
-
-typedef struct Node Node;
-
-struct Node {
-    int value;
-    Node* next;
-};
-
-Node* create_node(Node* previous_node) {
-    Node* new_node = (Node*)malloc(sizeof(Node));
-    new_node->next = NULL;
-    if (previous_node != NULL) {
-        previous_node -> next = new_node;
-    }
-    return new_node;
-}
-
-void delete_node(Node* previous_node) {
-    Node* exact_node = previous_node->next;
-    previous_node->next = exact_node->next;
-    free(exact_node);
-}
-
-Node* search_node(Node* head_node, int index) {
-    int i = 0;
-    Node* node = head_node;
-    while (node != NULL) {
-        if (i == index) {
-            return node;
-        }
-        node = node->next;
-        i++;
-    }
-    return NULL;
-}
-
-void change_node_value(Node* head_node, int index, int value) {
-    Node* searched_void = search_node(head_node, index);
-    if (searched_void == NULL) {
-            printf("Out of range\n");
-    } else {
-            Node* searched = searched_void;
-            searched->value = value;
-    }
-}
-
-void travel_all_nodes(Node* head_node) {
-    Node* node = head_node;
-    int i = 0;
-    while (node != NULL) {
-        printf("%d. Node & Value is = %d\n", i, node->value);
-        node = node->next;
-        i++;
-    }
-}
-
-int main(void) {
-    printf("Hello World\n");
-
-    Node* head_node= create_node(NULL);
-    head_node->value = 0;
-
-    printf("How many node do you want ?\n");
-    int node_count = 0;
-    scanf("%d", &node_count);
-
-
-    Node* previous_node = head_node;
-    for (int i = 0; i<node_count-1;i++) {
-        create_node(previous_node);
-        previous_node = previous_node->next;
-        previous_node->value = i+1;
-    }
-
-    travel_all_nodes(head_node);
-
-    printf("Which node do you want to be deleted ?\n");
-    int delete_index = 0;
-    scanf("%d", &delete_index);
-    if (delete_index == 0) {
-        Node* head_node_will_be_deleted = head_node;
-        head_node = head_node->next;
-        free(head_node_will_be_deleted);
-    } else {
-        void* searched_previous_void = search_node(head_node, delete_index-1);
-        if (searched_previous_void == NULL) {
-            printf("Out of range\n");
-            return -1;
-        } else {
-            Node* searched_previous = searched_previous_void;
-            if (searched_previous->next != NULL) {
-                delete_node(searched_previous);
-                printf("Deleted\n");
-            } else {
-                printf("Out of range\n");
-                return -1;
-            }
-        }
-    }
-
-    travel_all_nodes(head_node);
-
-    printf("Which node do you want to change it's value ?\n");
-    int change_node_value_index = 0;
-    scanf("%d", &change_node_value_index);
-
-    printf("What value do you want to assign ?\n");
-    int new_node_value = 0;
-    scanf("%d", &new_node_value);
-    change_node_value(head_node, change_node_value_index, new_node_value);
-
-    travel_all_nodes(head_node);
-}
\ No newline at end of file