Add files via upload

Author: iamshibly

1. Basic stack push po empty top.c

@@ -0,0 +1,64 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+#define MAX_SIZE 5
+
+int array[MAX_SIZE];
+int topN = -1;
+
+void push(int x){
+if (topN == MAX_SIZE - 1){
+    printf("Stack Overflow! Warning\n");
+}
+else{
+    topN++;
+    array[topN] = x;
+    printf("Number pushed onto the stack is: %d\n", x);
+    }
+}
+
+int pop(){
+if (topN == -1){
+    printf("Stack Underflow! Warning\n");
+    return -1;
+}
+else{
+    int poppedN = array[topN];
+    topN--;
+    return poppedN;
+}
+}
+
+int top(){
+return array[topN];
+}
+
+int isEmpty(){
+if(topN==-1){
+    return 1;
+}
+else{
+    return 0;
+}
+}
+
+int main(){
+
+push(10);
+push(20);
+push(30);
+push(40);
+push(50);
+
+
+printf("Top element: %d\n", top());
+
+printf("%d popped out of the stack\n", pop());
+printf("%d popped out of the stack\n", pop());
+
+printf("New top element: %d\n", top());
+
+printf("Is the stack empty? %s\n", isEmpty() ? "Yes" : "No");
+
+return 0;
+}

10. Traverse in void function-Single Linked List (Inserting a Node at the End).c

@@ -0,0 +1,52 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+struct node{
+    int data;
+    struct node *link;
+};
+
+void insert_Atthe_end(struct node *head){
+
+    struct node *ptr, *temp;
+    ptr = head;
+
+    temp = malloc(sizeof(struct node));
+    temp -> data = 99;
+    temp -> link = NULL;
+
+    while(ptr -> link != NULL){
+            ptr = ptr -> link;
+    }
+
+    ptr -> link = temp;
+
+}
+
+int main(){
+
+    struct node *head = malloc(sizeof(struct node));
+    head -> data = 45;
+    head -> link = NULL;
+
+    struct node *second = malloc(sizeof(struct node));
+    second -> data = 60;
+    second -> link = NULL;
+    head -> link = second;
+
+    second = malloc(sizeof(struct node));
+    second -> data = 77;
+    second -> link = NULL;
+
+    head -> link -> link = second;
+
+    insert_Atthe_end(head);
+
+    struct node *current = head;
+    while (current != NULL) {
+        printf("Data: %d\n", current->data);
+        current = current->link;
+    }
+
+return 0;
+}

11. Without traverse in call func-Single Linked List (Inserting a Node at the End).c

@@ -0,0 +1,44 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+struct node{
+    int data;
+    struct node *link;
+};
+
+struct node *insertAt_theEnd(struct node *ptr, int data){
+    struct node *temp = malloc(sizeof(struct node));
+
+    temp -> data = data;
+    temp -> link = NULL;
+
+    ptr -> link = temp;
+    return temp;
+
+}
+
+int main(){
+
+    struct node *head = malloc(sizeof(struct node));
+    head -> data = 45;
+    head -> link = NULL;
+
+    struct node *ptr = head;
+    ptr = insertAt_theEnd(ptr,60);
+    ptr = insertAt_theEnd(ptr,77);
+    ptr = insertAt_theEnd(ptr,98);
+
+    ptr = head;
+
+    printf("Data: ");
+
+    while(ptr != NULL){
+
+        printf("%d ", ptr -> data);
+        ptr = ptr -> link;
+
+    }
+
+return 0;
+}
+

12. Inserting the Data at the Beginning of Single Linked List.c

@@ -0,0 +1,47 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+struct node{
+    int data;
+    struct node *link;
+};
+
+struct node *add_beg(struct node *head,int d){
+
+    struct node *ptr = malloc(sizeof(struct node));
+    ptr -> data = d;
+    ptr -> link = NULL;
+
+    ptr -> link = head;
+    head = ptr;
+    return head;
+
+}
+
+int main(){
+
+    struct node *head = malloc(sizeof(struct node));
+    head -> data = 45;
+    head -> link = NULL;
+
+    struct node *ptr = malloc(sizeof(struct node));
+    ptr -> data = 60;
+    ptr -> link = NULL;
+    head -> link = ptr;
+
+    int d = 3;
+
+    head = add_beg(head,d);
+
+    ptr = head;
+    printf("Data: ");
+
+    while(ptr != NULL){
+
+        printf("%d ", ptr -> data);
+        ptr = ptr -> link;
+
+    }
+
+return 0;
+}

13. Single Linked List (Inserting a Node at a Certain Position).c

@@ -0,0 +1,68 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+struct node{
+    int data;
+    struct node *link;
+};
+
+struct node *insertAt_theEnd(struct node *ptr, int data){
+
+    struct node *temp = malloc(sizeof(struct node));
+
+    temp -> data = data;
+    temp -> link = NULL;
+
+    ptr -> link = temp;
+    return temp;
+
+}
+
+void add_at_pos(struct node *head, int data, int position){
+
+    struct node *ptr = head;
+    struct node *ptr2 = malloc(sizeof(struct node));
+    ptr2 -> data = data;
+    ptr2 -> link = NULL;
+
+    while (position != 2){
+
+        ptr = ptr -> link;
+        position --;
+
+    }
+
+    ptr2 -> link = ptr -> link;
+    ptr -> link = ptr2;
+
+}
+
+int main(){
+
+    struct node *head = malloc(sizeof(struct node));
+    head -> data = 45;
+    head -> link = NULL;
+
+    struct node *ptr = head;
+
+    ptr = insertAt_theEnd(ptr,60);
+    ptr = insertAt_theEnd(ptr,77);
+    ptr = insertAt_theEnd(ptr,108);
+
+    int data = 98, position = 4;
+
+    add_at_pos(head, data, position);
+
+    ptr = head;
+
+    printf("Data: ");
+
+    while (ptr != NULL){
+
+        printf("%d ", ptr-> data);
+        ptr = ptr -> link;
+
+    }
+
+return 0;
+}

14. Single Linked List (Deleting the First Node).c

@@ -0,0 +1,64 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+struct node {
+
+    int data;
+    struct node *link;
+
+};
+
+struct node *add_Node(struct node *ptr, int data){
+
+    struct node *temp = malloc(sizeof(struct node));
+    temp -> data = data;
+    temp -> link = NULL;
+
+    ptr -> link = temp;
+    return temp;
+
+}
+
+struct node *del_first(struct node *head){
+
+    if(head == NULL)
+        printf("List is empty");
+    else {
+
+        struct node *temp = head;
+        head = head -> link;
+        free(temp);
+        temp = NULL;
+
+    }
+
+    return head;
+
+}
+
+int main(){
+
+    struct node *head = malloc(sizeof(struct node));
+    head -> data = 15;
+    head -> link = NULL;
+
+    struct node *ptr = head;
+    ptr = add_Node(ptr,25);
+    ptr = add_Node(ptr,56);
+    ptr = add_Node(ptr,98);
+
+    head = del_first(head);
+
+    ptr = head;
+
+    printf("Data: ");
+
+    while(ptr != NULL){
+
+        printf("%d ", ptr -> data);
+        ptr = ptr -> link;
+
+    }
+
+return 0;
+}