Doubly linked list, with Separate functions for each operation Using C

-
#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
  struct node
  {
      int data;
       struct node *next, *prev;
  };
  struct node *head, *tail, *newnode, *temp;

  int count(int a)
  {
      static int count ;
      count +=a;
      return count;
  }
  void create()
  {
      int choice=1;
      while(choice==1){
      newnode = (struct node*)malloc(sizeof(struct node));
      count(1);
      newnode->next=0;
      newnode->prev=0;
      printf("\nenter data: ");
      scanf("%d",&newnode->data);
      if(head==0)
      {
          head=newnode;
          tail=newnode;
      }
      else
      {
          newnode->prev=tail;
          tail->next=newnode;
          tail=newnode;
      }
      printf("Want another element to be inserted(0,1): ");
      scanf("%d",&choice);
    }
  }
  void insertbeg()
  {
      int choice = 1;
      while(choice==1){
      newnode=(struct node*)malloc(sizeof(struct node));
      count(1);
      newnode->next=0;
      newnode->prev=0;
      printf("enter data: ");
      scanf("%d",&newnode->data);
      //first make the link to the previously existing first node;
      head->prev=newnode;
      newnode->next=head;
      head=newnode;
      printf("Want another element to be inserted in beginning(0,1): ");
      scanf("%d",&choice);
      }
  }
  void insertend()
  {   int choice =1;
      while(choice==1){
      newnode=(struct node*)malloc(sizeof(struct node));
      count(1);
      newnode->next=0;
      newnode->prev=0;
      printf("enter data: ");
      scanf("%d",&newnode->data);
      tail->next=newnode;
      newnode->prev=tail;
      tail=newnode;
      printf("Want another element to be inserted at end(0,1): ");
      scanf("%d",&choice);
      }
  }
  void insertpos()
  {
      int choice = 1,pos,i,x;
      while(choice==1)
      {
          x=count(0);
         printf("enter the position of insertion greater than 1 and less than the length of list(0,1): ");
         scanf("%d",&pos);
         if(pos>1 && pos<x)
         {
            count(1);
            newnode=(struct node*)malloc(sizeof(struct node));
            newnode->next=0;
            newnode->prev=0;
            printf("enter data: ");
            scanf("%d",&newnode->data);
            // Forming link;
            temp=head; i=1;
            while(i<pos-1)
            {
                temp=temp->next;
                i++;
            }
            newnode->prev=temp;
            newnode->next=temp->next;
            temp->next->prev=newnode;
            temp->next=newnode;
            printf("Do you want another element to be inserted in middle 0,1: ");
            scanf("%d",&choice);
         }
         else
         {
             printf("\nPosition cannot be <=1 or >=size of list");
             printf("\n");
             printf("Do you want to insert again(0,1): ");
             scanf("%d",&choice);
         }
      }

  }

  void listprint()
  {
      temp=head;
      printf("size is: %d\n",count(0));

      while(temp!=0)
      {
          printf("%d ",temp->data);
          temp=temp->next;
      }
  }
  void main()
  {
      int f=1, conti=1, choice;
      while(conti==1)
      {

      printf("\npress 1. to create list");
      printf("\npress 2. to enter node at beginning");
      printf("\npress 3. to enter node at end");
      printf("\npress 4. to enter node at certain position");
      printf("\npress 5. to print list");
      printf("\nenter your choice from given list: ");
      scanf("%d",&choice);
      if(choice==1)
      {   if(f==1)
          {create();
          f=0;}
          else
          printf("list already created");
      }

      else if(choice==2)
      insertbeg();
      else if(choice==3)
      insertend();
      else if(choice==4)
      insertpos();
      else if(choice==5)
      listprint();
      else
      printf("invalid choice");


      printf("\nDo you want to continue(0,1): ");
      scanf("%d",&conti);
      }
  }

Comments

  1. HotTalker31 August 2020 at 15:38

    You can directly use count variable by declaring it globally, and it can be accessed directly with out using scope resolution(::) operator.
    you can directly perform count++ operations.
    note this is possible, if no other variable with same name is declared.

    ReplyDelete

Post a Comment

Popular posts from this blog

First_Come_First_Serve CPU Scheduling

-
#include<stdio.h> #include<conio.h> struct proc {     int id;     int burst;     int at; }; int main() {     int n,i,j,total_waiting_time,waiting_time;     printf("Enter the number of processess: ");     scanf("%d",&n);     struct proc p[n],temp;     f or(i=0;i<n;i++)     {         p[i].id=i;         printf("Enter the arrival time of the process: ");         scanf("%d",&p[i].at);         printf("Enter the burst time of the process: ");         scanf("%d",&p[i].burst);     }     for(i=0;i<n;i++)     {         for(j=i+1;j<n;j++)         {             if(p[j].at<p[i].at)             {                 ...
Read more

Reversing stack Method 2 !! (One Helper Stack only)

-
#include   <bits/stdc++.h> using   namespace   std ; stack < int >  rev ( stack < int >  s ) {      int   size  =  s . size (),  x ,  y ,  t ;      stack < int >  s2 ;      size  -=  1 ;      while  ( size --)     {          t  =  size  +  1 ;          x  =  s . top ();          s . pop ();          while  ( t --)         {              s2 . push ( s . top ());              s . pop ();         }  ...
Read more

Populating Next Right Pointers in Each Node in O(1) space (without queue and level order)

-
Image
Example 1: Input: root = [1,2,3,4,5,6,7] Output: [1,#,2,3,#,4,5,6,7,#] Explanation: Given the above perfect binary tree (Figure A), your function should populate each next pointer to point to its next right node, just like in Figure B. The serialized output is in level order as connected by the next pointers, with '#' signifying the end of each level. Example 2: Input: root = [] Output: [] class Solution { public:     Node * connect ( Node * root )     {         Node * p1 = root , * p2 ;         while ( p1 != NULL )         {             p2 = p1 ;             while ( p2 != NULL )             {                 if ( p2 -> left )                     p2 -> left -> next = p2 -> right ;       ...
Read more

Calculate factorial of large numbers !! (Using Arrays)

-
#include   <bits/stdc++.h> using   namespace   std ; #define   max   10000 int   main () {      int   n ,  c ,  j ,  k ,  x ,  i ;      int   a [ max ];      cout   <<   "Enter the number: " ;      cin   >>   n ;      j  =  0 ;  // j will be pointing to new index created to stored carry      a [ 0 ] =  1 ;      for  ( i  =  2 ;  i  <=  n ;  i ++)     {          c  =  0 ;  //carry when each number of array is multiplied by i          //(i is a...
Read more

Multiplication of large numbers (Given in string format)

-
  class   Solution { public:      string   multiply ( string   num1 ,  string   num2 )     {          if  ( num1  ==  "0"  ||  num2  ==  "0" )              return   "0" ;          if  ( num1  ==  "1" )              return   num2 ;          if  ( num2  ==  "1" )              return   num1 ;          if  ( num1 . size () ==  1  &&  num2 . size () ==  1 )         {           ...
Read more

Left View of Binary Tree (Method 1 using recursion)

-
#include   <iostream> #include   <vector> using   namespace   std ; struct   TreeNode {      int   val ;      TreeNode  * left ;      TreeNode  * right ;      TreeNode () :  val ( 0 ),  left ( nullptr ),  right ( nullptr ) {}      TreeNode ( int   x ) :  val ( x ),  left ( nullptr ),  right ( nullptr ) {}      TreeNode ( int   x ,  TreeNode   * left ,  TreeNode   * right ) :                              val ( x ),  left ( left ),  right ( right ) {} }; TreeNode   * BuildTree () {      int   d ;      cin   >>   d ;      if  ( d  == -...
Read more

Check Bracket Sequence

-
#include<bits/stdc++.h> using namespace std; int main() {     int i,f,top=-1,size;     string s;     cin>>s;     size=s.size();     char a[size];     f=1;     for(i=0;i<s.size() && f==1;i++)     {         if(s[i]=='(')         a[++top]='(';         else if(s[i]==')')         {             if(top==-1)             f=0;             else             top-=1;         }     }     if(top!=-1 || f==0)     cout<<"invalid\n";     else     cout<<"Valid"; }
Read more

Image Multiplication

-
https://practice.geeksforgeeks.org/problems/image-multiplication0627/1 Input: 1 / \ 3 2 / \ / \ 7 6 5 4 / \ \ / \ \ 11 10 15 9 8 12 Output: 332 Explanation: Sum = (1*1) + (3*2) + (7*4) + (6*5) + (11*12) + (15*9) = 332 class Solution {     public:     void treeHelper ( Node * a , Node * b , long long int & ans )     {         if (a== NULL ||b== NULL )         return ;         long long int temp=( a -> data * b -> data )%( 1000000007 );         ans=(ans+temp)%( 1000000007 );         treeHelper ( a -> left , b -> right , ans);         treeHelper ( a -> right , b -> left , ans);     }   ...
Read more

Boundary Traversal of binary tree

-
struct Node {     int data;     Node * left, * right; }; class Solution { public:     void call_left ( vector < int > & v , Node * root )     {         if ( root == NULL )             return ;         if ( root ->left == NULL && root ->right == NULL )             return ; // don't push the leaf nodes.         v . push_back ( root ->data);         if ( root ->left)             call_left ( v , root ->left);         else             call_left ( v , root ->right);     }     void call_leaves ( vector < int > & v , Node * root )     {         if ( root == NULL )             return ;   ...
Read more

BST to greater sum tree

-
  // Input: //            2 //          /    \ //         1      6 //               /  \ //              3    7 // Output: 18 16 13 7 0 (InOrder) // Explanation: // Every node is replaced with the sum of nodes greater than itself. // The resultant tree is: //                16 //              /    \ //            18       7 //                   /   \ //                  13    0 //Bhaskar Varshney #include <iostream> #include <queue> using namespace std; struct TreeNode {     int val;     TreeNode *left;     TreeNode *rig...
Read more