CircularLL.cpp

#include <iostream>
#include <cstdlib>
using namespace std;

struct ListNode
{
    int data;
    ListNode* next;
}* list = NULL;

void insert(int value){
    ListNode* newNode = (ListNode*)malloc(sizeof(ListNode));
    newNode->data = value;
    if (list == NULL)
    {
        list = newNode;
        newNode->next = list;
        return;
    }
    else{
        ListNode* current = list;
        while (current->next != list)
        {
            current = current->next;
        }
        current->next = newNode;
        newNode->next = list;
    }
    
}
bool search(int value){
    if (list == NULL)
    {
        cout<<"List is empty"<<endl;
    }
    else{
        ListNode* current = list;
        do
        {
            if (current->data == value)
            {
                return true;
            }
            current = current->next;
        } while (current != list);
    }
    return false;
}
void display(){
    if (list == NULL)
    {
        cout<<"List is empty"<<endl;
    }
    else{
        ListNode* current = list;
        do
        {
            cout<<current->data<<" ";
            current = current->next;
        } while (current != list);
        
        cout<<endl;
    }
}
void Delete(int toDel){
    if (list == NULL)
    {
        cout<<"List is empty"<<endl;
        return;
    }
    ListNode* current = list;
    ListNode* prev;
    if(toDel == list->data){
        while (current->next != list)
        {
            current = current->next;
        }
        prev = list;
        list = list->next;
        free(prev);
        current->next = list;
    }
    else{
        while (current->next != list)
        {
            if (toDel == current->data)
            {
                prev->next = current->next;
                free(current);
                current = prev->next;
            }
            else{
                prev = current;
                current = current->next;
            }
        }
        //if toDEL is on the last node
        if (toDel == current->data)
        {
            prev->next = list;
            free(current);
        }
    }
}
int main(int argc, char const *argv[])
{
    int option;
    int value;
    while (true)
    {
        cout<<"1: Insert"<<endl;
        cout<<"2: Search"<<endl;
        cout<<"3: Delete"<<endl;
        cout<<"4: Display"<<endl;

        cout<<"Enter your choice ";
        cin>> option;
        switch (option)
        {
        case 1:
            cout<<"Enter value to insert ";
            cin>> value;
            insert(value);
            break;
        case 2:
            cout<<"Enter value to search ";
            cin>> value;
            if (search(value))
            {
                cout<<"Value Found"<<endl;
            }
            else{
                cout<<"Value Not Found"<<endl;
            }
            break;
        case 3:
            cout<<"Enter value to delete ";
            cin>> value;
            Delete(value);
            break;
        case 4:
            display();
        default:
            cout<<"Exit Successfully"<<endl;
            break;
        }
        if (option > 4)
        {
            break;
        }
    }

    return 0;
}