Linked List done

akashmartule/Linked List/Deletion.cpp

@@ -0,0 +1,64 @@
+#include<bits\stdc++.h>
+using namespace std;
+
+struct Node
+{
+    int data;
+    struct Node* next;
+}*first= NULL;
+
+void create(int A[],int n){
+    int i;
+    struct Node *t, *last;
+    first=new Node;
+    first->data=A[0];
+    first->next=NULL;
+    last=first;
+
+    for(i=1;i<n;i++){
+        t=new Node;
+        t->data=A[i];
+        t->next=NULL;
+        last->next=t;
+        last=t;
+    }
+}
+
+void Display(struct Node *p){
+    while(p!=NULL){
+        cout<<p->data<<" ";
+        p=p->next;
+    }
+}
+void Delete(struct Node *p, int index)
+{
+    struct  Node *q=NULL;
+    int x= -1,i;
+    if(index==1){
+        q=first;
+        x=first->data;
+        first=first->next;
+        delete q;
+
+    }
+    else{
+        q=p;
+        p=p->next;
+        q->next=p->next;
+        x=p->data;
+        delete p;
+
+    }
+
+
+
+}
+
+int main()
+{
+    int A[]={6,5,4,3,2};
+    create(A,5);
+    // cout<<Delete<<first,3;
+    Delete(first,3);
+    Display(first);
+}

akashmartule/Linked List/Display.cpp

@@ -0,0 +1,52 @@
+#include <iostream>
+using namespace std;
+
+class Node{
+public:
+    int data;
+    Node* next;
+};
+
+int main() {
+
+    int A[] = {3, 5, 7, 10, 15};
+
+    Node* head = new Node;
+
+    Node* temp;
+    Node* last;
+
+    head->data = A[0];
+    head->next = nullptr;
+    last = head;
+
+    // Create a Linked List
+    for (int i=1; i<sizeof(A)/sizeof(A[0]); i++){
+
+        // Create a temporary Node
+        temp = new Node;
+
+        // Populate temporary Node
+        temp->data = A[i];
+        temp->next = nullptr;
+
+        // last's next is pointing to temp
+        last->next = temp;
+        last = temp;
+    }
+
+    // Display Linked List
+    Node* p = head;
+
+    while (p != nullptr){
+        cout << p->data << " -> " << flush;
+        p = p->next;
+
+        // recurssive
+        // p=p->next;
+        // cout << p->data << " -> " << flush;
+
+    }
+
+    return 0;
+}

akashmartule/Linked List/MAX_Element.cpp

@@ -0,0 +1,58 @@
+#include<bits\stdc++.h>
+using namespace std;
+struct Node
+{
+  int data;
+  struct Node* next;
+}*first=  NULL;
+void create(int A[],int n)
+{
+    int i;
+    struct Node *t, *last;
+    first= new Node;
+    first->data=A[0];
+    first->next=NULL;
+    last=first;
+
+    for(i=1;i<n;i++){
+        t=new Node;
+        t->data=A[i];
+        t->next=NULL;
+        last->next=t;
+        last=t;
+
+    }
+
+}
+
+int Max(struct Node *p)
+{
+    int max= INT_MIN;
+    while(p!=NULL)
+    {
+        if(p->data>max)
+           max =p -> data;
+           p=p->next;
+    }
+    return max;
+
+}
+void Display(struct Node *p)
+{
+    while(p!=NULL)
+    {
+        cout<<p->data<<"  ";
+        p=p->next;
+    }
+}
+
+
+int main()
+{
+    int A[]= {4,5,6,7,8};
+    create(A,5);
+    Display(first);
+    cout<<"Maximum node in linked list is: "<<Max(first);
+    return 0;
+
+}

akashmartule/Linked List/Max.cpp

@@ -0,0 +1,60 @@
+#include<bits\stdc++.h>
+using namespace std;
+struct Node
+{
+    int data;
+    struct Node* next;
+}*first=NULL;
+
+void create(int A[],int n)
+{
+    int i;
+    struct Node *t, *last;
+    first=new Node;
+    first->data=A[0];
+    first->next=NULL;
+    last=first;
+
+    for(i=1;i<n;i++){
+        t=new Node;
+        t->data=A[i];
+        t->next=NULL;
+        last->next=t;
+        last=t;
+    }
+}
+
+void Display(struct Node *p)
+{
+    while(p!=NULL)
+    {
+        cout<<p->data<<" ";
+        p=p->next;
+    }
+}
+int Max(struct Node*p)
+{
+    int max=INT_MIN;
+    while(p!=NULL)
+    {
+        if(p->data>max)
+        max=p->data;
+        p=p->next;
+    }
+    return max;
+}
+
+int main()
+{
+
+
+
+  int  A[]={1,2,3,4,5,6};
+  create(A,6);
+  Display(first);
+  cout<<"maximum element is: "<<Max(first);
+  return 0;
+
+
+}
+

akashmartule/Linked List/Searching.cpp

@@ -0,0 +1,46 @@
+#include<iostream>
+using namespace std;
+
+struct Node
+{
+    int data;
+    struct Node* next;
+
+}*first=NULL;
+void create(int A[],int n)
+{
+    int i;
+    struct Node *t,*last;
+    first=new Node;
+    first->data=A[0];
+    first->next=NULL;
+    last=first;
+
+    for(i=1;i<n;i++)
+    {
+     t=new Node;
+     t->data=A[i];
+     t->next=NULL;
+     last->next=t;
+     last=t;
+    }
+
+};
+ Node* Lsearch(struct Node *p, int key)
+{
+    while(p!=NULL)
+    {
+        if(key==p->data);
+         return p;
+         p=p->next;
+    }
+    return NULL;
+}
+int main()
+{
+    int A[]={5,6,8,7,3,4};
+    create(A,6);
+    Lsearch(first,7);
+    return 0;
+
+}

akashmartule/Linked List/count_sum_node.cpp

@@ -0,0 +1,55 @@
+#include<bits\stdc++.h>
+using namespace std;
+class Node
+{
+    public:
+    int data;
+    Node* next;
+};
+void push(Node** head_ref, int new_data)
+{
+    Node* new_node= new Node();
+    new_node->data=new_data;
+    new_node->next= (*head_ref);
+    (*head_ref)=new_node;
+
+}
+int getCount(Node* head)
+{
+    int count=0;
+    Node* current=head;
+    while(current !=NULL)
+    {
+         count++;
+         current=current->next;
+    }
+    return count;
+}
+int getsum(Node* head)
+{
+    int sum=0;
+    Node* current=head;
+    while(current !=NULL ){
+        sum=sum + current->data;
+        current=current->next;
+    }
+    return sum;
+}
+
+int main()
+{
+    Node*head =NULL;
+
+    push(&head, 1);
+    push(&head, 2);
+    push(&head, 3);
+    push(&head, 4);
+    push(&head, 5);
+    push(&head, 6);
+
+    cout<<"Count of nodes is"<<getCount(head)<<endl;
+
+
+    cout<<"Sum of linked list: "<<getsum(head)<<endl;
+    return 0;
+}

akashmartule/Linked List/createLL.cpp

@@ -0,0 +1,43 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+class Node {
+public:
+    int data;
+    Node* next;
+};
+void printList(Node* n)
+  {
+
+      while(n!=NULL)
+      {
+          cout<<n->data<<" ";
+          n = n->next;
+      }
+}
+
+// Program to create a simple linked
+// list with 3 nodes
+int main()
+{
+    Node* head = NULL;
+    Node* second = NULL;
+    Node* third = NULL;
+
+    // allocate 3 nodes in the heap
+    head = new Node();
+    second = new Node();
+    third = new Node();
+
+    head->data=1;
+    head->next=second;
+
+    second->data=2;
+    second->next=third;
+
+    third->data=3;
+    third->next=NULL;
+
+    printList(head);
+    return 0;
+}