LINKLIST-->AGAIN BACK WITH NEW WRITING & SAME WORK WITH SMALL CODE AS THAN BEFORE

anubala331

/////BASE ADDRESS OF LINKLIST SHOULD NEVER BE LOST IF UB WANT TO ACCESS THE LINKLIST.....

//TO RECOGNISE LINKLIST I HAVE TWO TRICKS:-

////1)IF start or any pointer->next is on left side means ,,,we are putting to memory at that pointer into another pointer |

//|or memory by replacing other memory...

////2)IF WE ARE PUTTING NORMAL NAME LIKE temp into another pointer or memory...means we are putting memory to another pointe

//r or relacing memory of another normal type name ..//

////POINTS TO REMEMBER:---

////ALWAYS REMEMBER...2 POINTERS CAN POINT SAME MEMORY BUT TWO MEMORIES COULD NOT BE HOLD BY SAME POINTER

#include<stdio.h>

#include<stdlib.h>

struct node

{

int info;//info is normal int type variable ...so can not be a cause of linklist...bcz..this is a simple element

struct node *next;//wow///this is not a simple variable // this is pointer like variable of structure...inside the structure//variable is structure inside the structure pointing to itself when act as element

//this element of structure is also acting like a variable of structure...

};

int flag,node_no;//globally declared

**struct node* create_linklist();//all the functions are always globally declared...in header file ...**

**struct node* create_node();**

**//struct node* insert(struct node*);**

**int insert(struct node*);**

**int insert_end(struct node*);**

**//int insert_be(struct node*);**

**int insert_begin(struct node*);**

**void display(struct node* );**

**int delet(struct node*);**

**int delete_beg(struct node*);**

**int delete_end(struct node*);**

**int delete_O(struct node*);**

**int delete_E(struct node*);**

anubala331

**/AN IMPLEMENTATION OF LINKLIST IS MADE MORE SMALL USING COMMON STATEMENTS ONCE...../**

#include"header.h"

**void display(struct node* start)**

{

**struct node* temp;**

temp=start;//put starting address of linklist into ,,,temp..

int node_no=0;

if(start)

{

temp->info=node_no;//node_no is 0 at starting..//

printf("\nnode[%d] temp->info=%d temp->next=%d ",node_no,temp->info,temp->next);

}

while(temp->next)

{

temp=temp->next;

++node_no;//node no ++ments...

temp->info=node_no;

printf("\nnode[%d] temp->info=%d temp->next=%d ",node_no,temp->info,temp->next);//addresses & node no. of all the nodes will be printed...

}

**int insert_be(struct node* new)**

{

**struct node* temp;**

temp=malloc(8);//MALLOC TO TEMP BY 8...SAME AS SIZE OF STRUCT NODE...

int choose;

printf("\nINSERT AT 1B & 2E");

scanf("\n%d",&choose);

if(choose==1)//insertion of node at begining...//

{

temp->next=new->next;//alover start->next or new->null mil rha h//place memory of 2nd node into pointer of temp..

}

else if(choose==2)//insertion of node at end///

{

temp->next=NULL;//1st make temp->next =NULL

while(new->next !=NULL)

{

new=new->next;//MOVE TO LAST NODE...//

}

printf("\nnew in else after while=%d",new);

}

else

{

exit(0);

}

new->next=temp;//PLACE TEMP INTO new->next pointer...in both of cases either new is 1st node || new is last node...
return 0;
}

anubala331

int insert(struct node* new)

{

int choice,ret;

printf("\ncase 1:insert node in BEGINING & END");//MENU FOR INSERTION IS PRESENTED

printf("\ncase3:insert node at nth point &then continue to that node");

printf("\ncase 4:insert node at key point");

printf("\ncase 5:exit");

printf("enter for INSERT");//ENTER CHOICE FOR INSERTION

scanf("%d",&choice);

switch(choice)

{

case 1:

ret=insert_be(new);//INSERT ELEMENT AT BEGINING...& ALSO AT END WITH DIFFRENCE OF ONLY 1 STATEMENT

break;

case 5:

exit(0);

}

return 0;

}

struct node* create_node()

{

struct node* temp;

temp=(struct node*)malloc(sizeof(struct node));//MEMORY TO BASE NODE IS ALLOCATED

if(!temp)

{

perror("\nMALLOC");

goto OUT;

}

return temp;

OUT:

return 0;

}

struct node* create_linklist()

{

struct node* temp;

temp=create_node();

if(!temp)

{

printf("\nPLEASE BASE ADDRESS IS NOT LINKED");

}

flag=1;

return temp;

}

anubala331

int main()

{

**struct node start,new;//DECLARE VARIABLE OF STRUCTURE ....HERE IT IS POINTER OF TYPE STRUCT NODE**

int choice;

printf("\ncase 1:start linklist with base address");

printf("\ncase 2:insert node in linklist");//SAME AS BEFORE ...PRESENT THE MENU....//

printf("\ncase 3:delete node in linklist");

printf("\ncase 4:sort linklist");

printf("\ncase 5:display linklist");

printf("\ncase 6:exit");

do

{

printf("\nenter the value of choice");//CHOOSE THE CASE

scanf("%d",&choice);

switch(choice)

{

case 1:

if(flag == 0)

{

start=new=create_linklist();//TAKE BASE ADDRESS OF LINKLIST..ONCE

printf("\nLINKLIST IS CREATED& add of start=%d",start);

new->next=NULL;//MAKE NEXT TO BASE ADDRESS NULL....//

}

else

{

printf("linklist is already created=%d",start);//why it prints frm 0 node by taking new address

LINKLIST-->AGAIN BACK WITH NEW WRITING & SAME WORK WITH SMALL CODE AS THAN BEFORE

/////BASE ADDRESS OF LINKLIST SHOULD NEVER BE LOST IF UB WANT TO ACCESS THE LINKLIST.....

//TO RECOGNISE LINKLIST I HAVE TWO TRICKS:-

////1)IF start or any pointer->next is on left side means ,,,we are putting to memory at that pointer into another pointer |

//|or memory by replacing other memory...

////2)IF WE ARE PUTTING NORMAL NAME LIKE temp into another pointer or memory...means we are putting memory to another pointe

//r or relacing memory of another normal type name ..//

////POINTS TO REMEMBER:---

////ALWAYS REMEMBER...2 POINTERS CAN POINT SAME MEMORY BUT TWO MEMORIES COULD NOT BE HOLD BY SAME POINTER

#include<stdio.h>

#include<stdlib.h>

struct node

{

int info;//info is normal int type variable ...so can not be a cause of linklist...bcz..this is a simple element

struct node *next;//wow///this is not a simple variable // this is pointer like variable of structure...inside the structure//variable is structure inside the structure pointing to itself when act as element

//this element of structure is also acting like a variable of structure...

};

int flag,node_no;//globally declared

struct node* create_linklist();//all the functions are always globally declared...in header file ...

struct node* create_node();

//struct node* insert(struct node*);

int insert(struct node*);

int insert_end(struct node*);

//int insert_be(struct node*);

int insert_begin(struct node*);

void display(struct node* );

int delet(struct node*);

int delete_beg(struct node*);

int delete_end(struct node*);

int delete_O(struct node*);

int delete_E(struct node*);

/*AN IMPLEMENTATION OF LINKLIST IS MADE MORE SMALL USING COMMON STATEMENTS ONCE.....*/

#include"header.h"

void display(struct node* start)

{

struct node* temp;

temp=start;//put starting address of linklist into ,,,temp..

int node_no=0;

if(start)

{

temp->info=node_no;//node_no is 0 at starting..//

printf("\nnode[%d] temp->info=%d temp->next=%d ",node_no,temp->info,temp->next);

}

while(temp->next)

{

temp=temp->next;

++node_no;//node no ++ments...

temp->info=node_no;

printf("\nnode[%d] temp->info=%d temp->next=%d ",node_no,temp->info,temp->next);//addresses & node no. of all the nodes will be printed...

}

}

int insert_be(struct node* new)

{

struct node* temp;

temp=malloc(8);//MALLOC TO TEMP BY 8...SAME AS SIZE OF STRUCT NODE...

int choose;

printf("\nINSERT AT 1B & 2E");

scanf("\n%d",&choose);

if(choose==1)//insertion of node at begining...//

{

temp->next=new->next;//alover start->next or new->null mil rha h//place memory of 2nd node into pointer of temp..

}

else if(choose==2)//insertion of node at end///

{

temp->next=NULL;//1st make temp->next =NULL

while(new->next !=NULL)

{

new=new->next;//MOVE TO LAST NODE...//

}

printf("\nnew in else after while=%d",new);

}

else

{

exit(0);

}

new->next=temp;//PLACE TEMP INTO new->next pointer...in both of cases either new is 1st node || new is last node... return 0;}

int insert(struct node* new)

{

int choice,ret;

printf("\ncase 1:insert node in BEGINING & END");//MENU FOR INSERTION IS PRESENTED

**struct node* create_linklist();//all the functions are always globally declared...in header file ...**

**struct node* create_node();**

**//struct node* insert(struct node*);**

**int insert(struct node*);**

**int insert_end(struct node*);**

**//int insert_be(struct node*);**

**int insert_begin(struct node*);**

**void display(struct node* );**

**int delet(struct node*);**

**int delete_beg(struct node*);**

**int delete_end(struct node*);**

**int delete_O(struct node*);**

**int delete_E(struct node*);**

**/AN IMPLEMENTATION OF LINKLIST IS MADE MORE SMALL USING COMMON STATEMENTS ONCE...../**

**void display(struct node* start)**

**struct node* temp;**

**int insert_be(struct node* new)**

**struct node* temp;**

new->next=temp;//PLACE TEMP INTO new->next pointer...in both of cases either new is 1st node || new is last node...
return 0;
}

**struct node start,new;//DECLARE VARIABLE OF STRUCTURE ....HERE IT IS POINTER OF TYPE STRUCT NODE**