LinkListProgram46.c

#include<stdio.h>
#include<stdlib.h>

// Terminal Colors just to heighlight the nodes .. and its data
#define MAG   "\x1B[35m"
#define CYN   "\x1B[36m"
#define RESET "\x1B[0m"


// Structure of a particular node ...
typedef struct node{
	
	int data;
	struct node *nextNode;
}SLLNode;


// Function that creates a indivisual node and assigns feilds of the node
SLLNode *createNode(int num){
	
	SLLNode *newNode = (SLLNode*)malloc(sizeof(SLLNode));
	newNode->nextNode = NULL;
	newNode->data = num;
	return newNode;
}

// This function will count the nodes in the List
int countNodes(SLLNode **headNode, SLLNode **tailNode){
	
	SLLNode *dummyNode = *headNode;
	int count = 0;
	for (; dummyNode != NULL && dummyNode -> nextNode != (*tailNode) -> nextNode; count++)
		dummyNode = dummyNode -> nextNode;
	return count;
}

// At the time of Termination of program this function is called that will free the memory of heap  ...
void freeAllNodes(SLLNode **headNode, SLLNode **tailNode){
	
	if (*headNode == NULL){return;}
	if ((*headNode)->nextNode == NULL)
		free(*headNode);
	else{
		while ((*headNode)->nextNode != *tailNode){
			SLLNode *freeNode = *headNode;
			*headNode = (*headNode)->nextNode;
			free(freeNode);
		}
	}


}

// This function will count no. of tokens in a string on a delim
int getTokensCount(char *string, char delim){

    int tokenCounter = 0;
    char *strCpy = string;
    int flag = 0;
    char ch;

    while((ch = *(strCpy++)) != '\0'){
        
        if(ch == delim && flag){
            
            tokenCounter += 1;
            flag = 0;
        }
        if(ch != delim){
            flag = 1;
        }
        if(ch == delim && *strCpy == '\0')
            tokenCounter -= 1;
        
    }
    
    return tokenCounter + 1;

}

// This function will tokenise a string on a specific delimiter and return 
// the pointer to int array converted of the string 
int *tokeniseString(char *string, char delim){

    int tokenCounter = 0;
    int *tokenArray;
    int *iTokenArr;
    char *strCpy = string;
    char buffer[10];
    int iBuff = 0;
    int flag = 0;
    char ch;
    
    tokenCounter = getTokensCount(string, delim);

    tokenArray = (int*) malloc(tokenCounter * sizeof(int));
    iTokenArr = tokenArray;
    strCpy = string;
    flag = 0;
    while((ch = *(strCpy++)) != '\0'){
        
        if(ch == delim && flag){
            
            buffer[iBuff] = '\0';
            *(iTokenArr++) = atoi(buffer);
            iBuff = 0;
            flag = 0;
        }
        if(ch != delim){
            
            *(buffer + iBuff) = ch;
            iBuff ++;
            flag = 1;
        }
        if(*strCpy == '\0'){
            
            buffer[iBuff] = '\0';
            *(iTokenArr++) = atoi(buffer);
        }
        
    }
    return tokenArray;
}

// This function will add a new Node to the end of the nodes ...
void addNewNode(SLLNode **headNode, SLLNode **tailNode, int num){

	SLLNode *newNode = createNode(num);
	if (*headNode == NULL){
		*headNode = *tailNode = newNode;
        (*tailNode) -> nextNode = *headNode;
		

	}else{
		SLLNode **dummyNode = headNode;
		while((*dummyNode)->nextNode != (*tailNode) -> nextNode){
			dummyNode = &(*dummyNode) -> nextNode;
	
		}
		(*dummyNode)->nextNode = newNode;
        newNode -> nextNode = *headNode;
        *tailNode = newNode;
	}

}

// This function will take a input string and create a linked List from it ..
int createLinkedListFromNumberString(SLLNode **headNode,SLLNode **tailNode, char *string){

    int *tokensFromString = tokeniseString(string, ' ');   // Default delim is single space bar i.e. ' '
    int tokenCount = getTokensCount(string, ' ');           // Default delim is single space bar i.e. ' '

    for (int i = 0; i<tokenCount; i++){
        addNewNode(headNode, tailNode,tokensFromString[i]);
    }

    return 0;


}

// This function will the first node of CLList ...
int deleteFirstPosition(SLLNode **headNode, SLLNode **tailNode){

    if (*headNode == NULL){
        free(*headNode);
        *headNode = *tailNode = NULL;
    }
    SLLNode *dummyNode = *headNode;
    *headNode = (*headNode) -> nextNode;
    (*tailNode) -> nextNode = *headNode;
    free(dummyNode);

    return 0;
    
}

// This function will delete the Last node of CLList ...
int deleteLastPosition(SLLNode **headNode, SLLNode **tailNode){


    if (*headNode == NULL || (*headNode) -> nextNode == *headNode){
        *headNode = *tailNode =  NULL;
        return -1;
    }

    SLLNode *dummyNode = *headNode;
    while (dummyNode -> nextNode -> nextNode != *headNode){
        dummyNode = dummyNode -> nextNode;
    }

    *tailNode = dummyNode;
    (*tailNode) -> nextNode = *headNode;
    //free(dummyNode->nextNode);

    return 0;
    
}

// This function will the Last node of CLList ...
int deleteAtPosition(SLLNode **headNode, SLLNode **tailNode, int pos){

    
    int count = 2;
    SLLNode *dummyNode = *headNode;

    if (pos < 1 || pos > countNodes(&(*headNode),&(*tailNode)))
        return -1;

    if (pos == 1){
        deleteFirstPosition(headNode, tailNode);
        return 0;
    }

    if (pos == countNodes(&(*headNode),&(*tailNode)) - 1){
        deleteLastPosition(headNode, tailNode);    
        return 0;
    }

    while (count != pos){

        dummyNode = dummyNode -> nextNode;
        count ++;
    }

    SLLNode *tempNode = dummyNode -> nextNode -> nextNode;
    dummyNode -> nextNode = dummyNode -> nextNode -> nextNode;
    free(tempNode);
    


    return 0;
    
}

// This function will display the list of all the created nodes ...
void displayNodes(SLLNode **headNode, SLLNode **tailNode){

	SLLNode *dummyNode = *headNode;
    if (dummyNode == NULL){return;}
    do{
        printf("|\033[1;35m %d \033[0| \033[1;36m->\033[0m "RESET,dummyNode->data);
		dummyNode = dummyNode->nextNode;
    }while(dummyNode != *headNode);
}


// Driver code containing a menu to display options ...
void main(void){

	int choice, retValue, pos;
    char str[256];
    SLLNode *headNode = NULL;
    SLLNode *tailNode = NULL;
	do{

		printf("\nmenu:\n");
		printf("1] Add new Node (CLList 1)? : \n");
		printf("2] Display Nodes ? : \n");
		printf("3] Delete @ specified position? :\n");
		printf("4] Exit :\n");

		printf("Enter a option --> ");
		scanf("%d",&choice);

		switch(choice){

			case 1: printf("\nEnter nodes data seperated by delimiter(space key i.e ' ') :");
				scanf(" %[^\n]",str);
                printf("\n%s",str);
				createLinkedListFromNumberString(&headNode, &tailNode, str);
				break;  
			case 2:	displayNodes(&headNode, &tailNode);
				break;
			case 3:
            printf("Enter a position to delete Node :");
                scanf("%d",&pos);
                retValue = deleteAtPosition(&headNode, &tailNode, pos);
                if (retValue == -1)
                    printf(CYN"\t\tNo nodes Present to delete ..."RESET);
                break;
			case 4: freeAllNodes(&headNode, &tailNode);
				exit(EXIT_SUCCESS);
				break;
			default:
				printf(CYN"\t\tTry again ..."RESET);
		}
	}while(1);
}