//Finally, works all operations with the single linked list #include #include #define DEBUG #define LINE "----------------------------------------" #define CLS "clear" #ifndef DEBUG #ifdef LINUX #define CLS "clear" #else CLS "cls" #endif // LINUX #endif // DEBUG typedef struct node { int x; struct node * head; } node_t; typedef node_t * nodePtr; int showMenu (void); int insertAtBegining (nodePtr *pTr, int value); void printList (nodePtr *pTr); int exitMenu (void); int input (void); int insertAtEnd (nodePtr *pTr, int value); int insertAtSpecPosition (nodePtr *pTr, int value, int position); int deleteNodeAnyPosition (nodePtr *pTr, int position); int updateNodeValue (nodePtr *pTr, int value, int position); int searchElementImList (nodePtr *pTr, int value); int totalNumberOfNode (nodePtr *pTr); int main() { nodePtr pTr = NULL; int choice = 0; int ex = -1; int data = 0; while (choice !=8&&ex !=0){ choice = showMenu (); if (choice == 1){ data = input (); if (insertAtBegining (&pTr,data) == 0){ printf ("\nCan't allocate memory"); exit (-1); } } if (choice == 2){ data=input(); if (insertAtEnd (&pTr, data)==0){ printf ("\nCan't allocate memory"); exit (-1); } } if (choice == 3){ data=input(); int pos = 0,c=0; printf ("\n Insert position (node with NULL header has zero position, next is first and so forth): "); while (scanf ("%i",&pos)!=1){ printf ("\n You inserted wrong value "); c=getchar(); } if (insertAtSpecPosition (&pTr, data, pos)==0){ printf ("\nCan't allocate memory"); exit (-1); } } if (choice == 4){ printf ("\n Delete position (node with NULL header has zero position, next is first and so forth): "); int pos = 0,c=0; while (scanf ("%i",&pos)!=1){ printf ("\n You inserted wrong value "); c=getchar(); } if (deleteNodeAnyPosition (&pTr, pos)==1) printf ("\n Node has deleted successful "); } if (choice == 5){ data=input(); printf ("\n Insert position for updating (node with NULL header has zero position, next is first and so forth): "); int pos = 0,c=0; while (scanf ("%i",&pos)!=1){ printf ("\n You inserted wrong value "); c=getchar(); } if (updateNodeValue (&pTr,data, pos)==1) printf ("\n Node has been updated successful "); } if (choice == 6){ data=input(); int position =0; nodePtr Ptr = pTr; int totalNodes = (totalNumberOfNode (&Ptr)); printf ("\n List has %i value at: ", data); printf ("\n (node with NULL header has zero position, next is first and so forth)\n"); while (Ptr !=NULL) { int y = searchElementImList(&Ptr,data); if (y == 0){ printf ("\n List doesn't have any more node with that value "); break; } position = position + y; printf (" %i position\t", (totalNodes - position)); } } if (choice == 7){ printList (&pTr); } if (choice == 8){ return 1; } ex = exitMenu(); } printf ("\nChoice is %i", choice ); return 0; } // Show Menu function int showMenu (void) { int choice =0; char c; while (choice<1||choice >8){ system (CLS); printf ("\n\n"LINE"\n\n"); printf ("\tOperations on linked list:\n\n"); printf ("\n\n"LINE"\n\n"); printf ("1.Insert node at beginning\n" "2.Insert node at end\n" "3.Insert node at specific position\n" "4.Delete node from any position\n" "5.Update node value\n" "6.Search element in the list\n" "7.Display all list\n" "8.Exit"); printf ("\n\n"LINE"\n\n"); printf ("\tInter your choice:\n\n"); if (scanf ("%i", &choice) !=1) { printf ("\n You inserted wrong choice"); choice=0; c=getchar(); }; } return choice; } //Insert at beginning function //Takes ** to node and int data, returns 1 if successful or 0 if not int insertAtBegining (nodePtr *pTr, int value) { nodePtr currentPtr = NULL; currentPtr = malloc (sizeof(node_t)); if (currentPtr == NULL) return 0; currentPtr->head = *pTr; currentPtr->x = value; *pTr = currentPtr; return 1; } //Print all list function, takes ** to list void printList (nodePtr *pTr) { nodePtr currentPtr = *pTr; if (currentPtr == NULL) { printf ("\n =List is empty"); return; } printf ("\n"LINE); printf ("\nCurrent list is:\n"); while (currentPtr !=NULL){ if (currentPtr->head == NULL) printf ("%i (NULL header)\t", currentPtr->x); else printf ("%i\t",currentPtr->x); currentPtr = currentPtr ->head; } } // Return 0 for exit and 1 for continue int exitMenu (void) { int i = -1; int c=0; printf ("\n"LINE); while (i<0||i>1){ printf ("\nContinue (1) or exit (0)?\n"); if (scanf ("%i", &i) !=1) { printf ("\n You inserted wrong choice "); c=getchar(); }; } if (i==0) return 0; else { system (CLS); return 1; } } int input (void) { int value = 0; int c; printf ("\n"LINE); printf ("\n Insert value: "); while (scanf ("%i",&value)!=1){ printf ("\n You inserted wrong value "); c=getchar(); }; return value; } //Takes ** pointer to list and int data, returns 1 when success and 0 when fault int insertAtEnd (nodePtr *pTr, int value) { nodePtr currentPtr = *pTr; nodePtr newNodePtr = NULL; if (*pTr == NULL) { newNodePtr = malloc (sizeof(node_t)); if (newNodePtr == NULL) return 0; newNodePtr->x = value; newNodePtr->head = NULL; *pTr = newNodePtr; } else { while (currentPtr ->head != NULL){ currentPtr = currentPtr->head; } newNodePtr = malloc (sizeof(node_t)); if (newNodePtr == NULL) return 0; newNodePtr->x=value; newNodePtr->head=NULL; currentPtr->head = newNodePtr; } return 1; } //Takes ** pointer to the list and int data, returns 1 when successful and 0 when fault and -1 when position is out of range //Also takes position. The last node with NULL header has a zero position, next one, next second and so forth int insertAtSpecPosition (nodePtr *pTr, int value, int position) { nodePtr currentPtr = *pTr; nodePtr newNodePtr = NULL; nodePtr previusPtr = NULL; nodePtr nexPtr =NULL; int countNode = totalNumberOfNode (¤tPtr); if (position >countNode||position <0) { printf ("\n Your position is out of range\n The list has only %i nodes",countNode); return -1; } if (*pTr == NULL) { newNodePtr = malloc (sizeof(node_t)); if (newNodePtr == NULL) return 0; newNodePtr->x = value; newNodePtr->head = NULL; *pTr = newNodePtr; } else { int insertPosition = countNode - position; for (int count =1; count < insertPosition; count++){ currentPtr = currentPtr->head; } previusPtr = currentPtr; nexPtr = currentPtr->head; newNodePtr = malloc (sizeof(node_t)); if (newNodePtr == NULL) return 0; newNodePtr->x = value; newNodePtr->head = nexPtr; previusPtr->head=newNodePtr; } return 1; } //Takes ** pointer to list, int number of position (node with zero header is zero,next first and so forth) //Returns 1 if successful and 0 if fault int deleteNodeAnyPosition(nodePtr *pTr, int position) { nodePtr currentPtr = *pTr; nodePtr nextPtr = NULL; nodePtr previusPtr = NULL; if (*pTr==NULL) { printf ("\nThe list is empty "); return 0; } int countNode = totalNumberOfNode (¤tPtr); if (position >countNode||position <0) { printf ("\n Your position is out of range\n The list has only %i nodes",countNode); return 0; } if (position == (countNode-1)) { *pTr = currentPtr->head; free (currentPtr); return 1; } int delPosition = countNode - position; for (int count =1; count < (delPosition-1); count++){ currentPtr = currentPtr->head; } previusPtr = currentPtr; currentPtr=currentPtr->head; nextPtr = currentPtr->head; previusPtr->head = nextPtr; free (currentPtr); return 1; } // Takes ** pointer to the list, int data, int position to update, returns 1 if successful and 0 if not. int updateNodeValue (nodePtr *pTr, int value, int position) { nodePtr currentPtr = *pTr; if (*pTr == NULL) { printf ("\n The list is empty "); return 0; } int countNode = totalNumberOfNode (¤tPtr); if (position >countNode||position <0) { printf ("\n Your position is out of range\n The list has only %i nodes",countNode); return 0; } int delPosition = countNode - position; for (int count =1; count < delPosition; count++){ currentPtr = currentPtr->head; } currentPtr ->x = value; return 1; } //Takes ** pointer to the list, int data for searhing, return position of mode with data. and 0 if fault. int searchElementImList (nodePtr *Ptr, int data) { nodePtr current = *Ptr; if (*Ptr == NULL) { printf ("\n List is empty"); return 0; } int countNode = 0; while (current != NULL){ countNode++; if (current->x == data) { *Ptr = current->head; return countNode; } current = current->head; *Ptr = current; } return 0; } // Takes ** pointer to the list, returns int number of nodes in the list int totalNumberOfNode (nodePtr *pTr) { nodePtr current = *pTr; int count =0; while (current != NULL){ current= current->head; count++; } return count; }

SingleLinkedListTest