Breaking News: Grepper is joining You.com. Read the official announcement!

different methods of linked list - with code for the singly linked list

Laraveller answered on October 27, 2023 Popularity 3/10 Helpfulness 1/10

answer different methods of linked list - with code for the singly linked list

different methods of linked list - with code for the singly linked list

Comment

#include <iostream>

class Node {
public:
    int data;
    Node* next;

    Node(int value) : data(value), next(nullptr) {}
};

class LinkedList {
private:
    Node* head;

public:
    LinkedList() : head(nullptr) {}

    // Method to insert a node at the beginning of the list
    void insertAtBeginning(int value) {
        Node* newNode = new Node(value);
        newNode->next = head;
        head = newNode;
    }

    // Method to insert a node at the end of the list
    void insertAtEnd(int value) {
        Node* newNode = new Node(value);
        if (!head) {
            head = newNode;
        } else {
            Node* current = head;
            while (current->next) {
                current = current->next;
            }
            current->next = newNode;
        }
    }

    // Method to delete a node with a specific value
    void deleteNode(int value) {
        if (!head) {
            return; // List is empty
        }

        if (head->data == value) {
            Node* temp = head;
            head = head->next;
            delete temp;
            return;
        }

        Node* current = head;
        while (current->next) {
            if (current->next->data == value) {
                Node* temp = current->next;
                current->next = current->next->next;
                delete temp;
                return;
            }
            current = current->next;
        }
    }

    // Method to search for a node with a specific value
    bool search(int value) {
        Node* current = head;
        while (current) {
            if (current->data == value) {
                return true;
            }
            current = current->next;
        }
        return false;
    }

    // Method to display the linked list
    void display() {
        Node* current = head;
        while (current) {
            std::cout << current->data << " -> ";
            current = current->next;
        }
        std::cout << "nullptr" << std::endl;
    }
};

int main() {
    LinkedList myList;

    myList.insertAtBeginning(1);
    myList.insertAtEnd(2);
    myList.insertAtEnd(3);

    std::cout << "Linked List: ";
    myList.display();

    myList.deleteNode(2);

    std::cout << "Linked List after deleting 2: ";
    myList.display();

    bool found = myList.search(3);
    if (found) {
        std::cout << "3 found in the list." << std::endl;
    } else {
        std::cout << "3 not found in the list." << std::endl;
    }

    return 0;
}

Popularity 3/10 Helpfulness 1/10 Language cpp

Source: Grepper

Tags: c++ linked-list methods

Link to this answer
Share Copy Link

Contributed on Oct 27 2023

Laraveller

0 Answers Avg Quality 2/10

different methods of linked list - with code for the singly linked list

Contents

More Related Answers

different methods of linked list - with code for the singly linked list

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.