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

create linked list in c++

Sparkling Sloth answered on September 28, 2021 Popularity 8/10 Helpfulness 2/10

answer create linked list in c++

create linked list in c++

Comment

// C++ program for the above approach
#include <iostream>
using namespace std;
  
// Node class to represent
// a node of the linked list.
class Node {
public:
    int data;
    Node* next;
  
    // Default constructor
    Node()
    {
        data = 0;
        next = NULL;
    }
  
    // Parameterised Constructor
    Node(int data)
    {
        this->data = data;
        this->next = NULL;
    }
};
  
// Linked list class to
// implement a linked list.
class Linkedlist {
    Node* head;
  
public:
    // Default constructor
    Linkedlist() { head = NULL; }
  
    // Function to insert a
    // node at the end of the
    // linked list.
    void insertNode(int);
  
    // Function to print the
    // linked list.
    void printList();
  
    // Function to delete the
    // node at given position
    void deleteNode(int);
};
  
// Function to delete the
// node at given position
void Linkedlist::deleteNode(int nodeOffset)
{
    Node *temp1 = head, *temp2 = NULL;
    int ListLen = 0;
  
    if (head == NULL) {
        cout << "List empty." << endl;
        return;
    }
  
    // Find length of the linked-list.
    while (temp1 != NULL) {
        temp1 = temp1->next;
        ListLen++;
    }
  
    // Check if the position to be
    // deleted is greater than the length
    // of the linked list.
    if (ListLen < nodeOffset) {
        cout << "Index out of range"
             << endl;
        return;
    }
  
    // Declare temp1
    temp1 = head;
  
    // Deleting the head.
    if (nodeOffset == 1) {
  
        // Update head
        head = head->next;
        delete temp1;
        return;
    }
  
    // Traverse the list to
    // find the node to be deleted.
    while (nodeOffset-- > 1) {
  
        // Update temp2
        temp2 = temp1;
  
        // Update temp1
        temp1 = temp1->next;
    }
  
    // Change the next pointer
    // of the previous node.
    temp2->next = temp1->next;
  
    // Delete the node
    delete temp1;
}
  
// Function to insert a new node.
void Linkedlist::insertNode(int data)
{
    // Create the new Node.
    Node* newNode = new Node(data);
  
    // Assign to head
    if (head == NULL) {
        head = newNode;
        return;
    }
  
    // Traverse till end of list
    Node* temp = head;
    while (temp->next != NULL) {
  
        // Update temp
        temp = temp->next;
    }
  
    // Insert at the last.
    temp->next = newNode;
}
  
// Function to print the
// nodes of the linked list.
void Linkedlist::printList()
{
    Node* temp = head;
  
    // Check for empty list.
    if (head == NULL) {
        cout << "List empty" << endl;
        return;
    }
  
    // Traverse the list.
    while (temp != NULL) {
        cout << temp->data << " ";
        temp = temp->next;
    }
}
  
// Driver Code
int main()
{
    Linkedlist list;
  
    // Inserting nodes
    list.insertNode(1);
    list.insertNode(2);
    list.insertNode(3);
    list.insertNode(4);
  
    cout << "Elements of the list are: ";
  
    // Print the list
    list.printList();
    cout << endl;
  
    // Delete node at position 2.
    list.deleteNode(2);
  
    cout << "Elements of the list are: ";
    list.printList();
    cout << endl;
    return 0;
}

Popularity 8/10 Helpfulness 2/10 Language cpp

Source: www.geeksforgeeks.org

Tags: c++ linked-list

Link to this answer
Share Copy Link

Contributed on Sep 24 2023

Sparkling Sloth

0 Answers Avg Quality 2/10

Closely Related Answers

linked list c++

Comment

/*
	Linked List with Dynamic Memory Allocation in C++
*/

struct Node {
    int data;
    Node *next;
};


class LinkedList {
    private:
        Node *head = new Node;

    public:
        LinkedList() {
            this->head->next = nullptr;
            cout << endl << endl;
        }

        ~LinkedList() {
            Node *current = head;
            cout << "Destructor: " << endl;

            while (current != nullptr) {
                Node *nextNode = current->next;
                cout << "   delete on " << current->data << endl;
                delete current;
                current = nextNode;
            }
        }

        LinkedList &append(const int &data) {
            if(this->head->next == nullptr) {
                Node *node = new Node;
                node->data = data;
                this->head->next = node;
            } else {
                Node *newNode = new Node;

                newNode->data = data;
                newNode->next = nullptr;

                Node *currentNode = this->head;

                while (currentNode->next != nullptr) {
                    currentNode = currentNode->next;
                }

                currentNode->next = newNode;
            }

            return *this;
        }

        LinkedList &insert(const int &data) {
            Node *newNode = new Node;
            newNode->data = data;
            newNode->next = this->head->next;
            this->head->next = newNode;

            return *this;
        }

        LinkedList &display() {
            Node *currentNode = this->head;

            while (currentNode->next != nullptr) {
                currentNode = currentNode->next;
                cout << "[" << currentNode->data << " | " << currentNode->next << ((currentNode->next != nullptr) ? "] ---> " : "] ");
            }
            cout << endl;

            return *this;
        }

        bool search(const int &data) const {
            Node *currentNode = this->head;

            do {
                if (currentNode->data == data) {
                    return true;
                }
            } while(currentNode = currentNode->next);

            return false;
        }

        LinkedList &remove(const int &data) {
            Node *currentNode = this->head;

            do {
                if (currentNode->next->data == data) {
                    Node *temp = currentNode->next;
                    currentNode->next = currentNode->next->next;
                    delete temp;
                    break;
                }
            } while((currentNode = currentNode->next) && (currentNode->next != nullptr));

            return *this;
        }
};


int main() {

    /*      Example usage:     */
    LinkedList list = LinkedList();

    list.append(1).append(2).append(3).append(4);
    
    list.display();

    list.insert(5).display();

    bool isFound = list.search(4);

    cout << std::boolalpha << endl;
    cout << isFound;
    cout << endl << endl;

    list.remove(3).display().remove(4).display().remove(5).display();

    cout << endl;

    /*  
        Example Output: 
        
        [1 | 0x7f9092f05c80] ---> [2 | 0x7f9092f05c90] ---> [3 | 0x7f9092f05ca0] ---> [4 | 0x0] 
        [5 | 0x7f9092f05c70] ---> [1 | 0x7f9092f05c80] ---> [2 | 0x7f9092f05c90] ---> [3 | 0x7f9092f05ca0] ---> [4 | 0x0] 

        true

        [5 | 0x7f9092f05c70] ---> [1 | 0x7f9092f05c80] ---> [2 | 0x7f9092f05ca0] ---> [4 | 0x0] 
        [5 | 0x7f9092f05c70] ---> [1 | 0x7f9092f05c80] ---> [2 | 0x0] 
        [1 | 0x7f9092f05c80] ---> [2 | 0x0] 

        Destructor: 
            delete on 0
            delete on 1
            delete on 2
    */

    return 0;
}

Popularity 9/10 Helpfulness 4/10 Language cpp

Source: Grepper

Tags: c++ linked-list linked-l

Link to this answer
Share Copy Link

Contributed on Jul 17 2023

Mysterious Macaque

0 Answers Avg Quality 2/10

c++ linked list

Comment

#include<bits/stdc++.h>
using namespace std;
struct Node
{
    Node *next;
    int data;
};
void print(Node *n)
{
    while(n!=NULL)
    {
        cout<<n->data<<" ";
        n=n->next;
    }
}
int main()
{
    Node* head,*second,*third = NULL;


    head=new Node();
    second=new Node();
    third=new Node();

//First Node
    head->data=1;
    head->next=second;

//Second Node
    second->data=2;
    second->next=third;

//Third Node
    third->data=3;
    third->next=NULL;
    print(head);
//@rahulsharmaah
}

Popularity 10/10 Helpfulness 4/10 Language cpp

Source: Grepper

Tags: c++

Link to this answer
Share Copy Link

Contributed on Feb 19 2022

rahulsharma

0 Answers Avg Quality 2/10

Linked list in c++

Comment

struct node
{
  int data;
  struct node *next;
};

/* Initialize nodes */
struct node *head;
struct node *one = NULL;
struct node *two = NULL;
struct node *three = NULL;

/* Allocate memory */
one = malloc(sizeof(struct node));
two = malloc(sizeof(struct node));
three = malloc(sizeof(struct node));

/* Assign data values */
one->data = 1;
two->data = 2;
three->data=3;

/* Connect nodes */
one->next = two;
two->next = three;
three->next = NULL;

/* Save address of first node in head */
head = one;

Popularity 10/10 Helpfulness 3/10 Language cpp

Source: Grepper

Tags: c++

Link to this answer
Share Copy Link

Contributed on Mar 09 2022

Ren

0 Answers Avg Quality 2/10

linked list in c++

Comment

#include <iostream>

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

// Linked list class
class LinkedList {
private:
    Node* head;

public:
    LinkedList() {
        head = nullptr;
    }

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

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

int main() {
    LinkedList list;

    // Insert elements into the list
    list.insert(5);
    list.insert(10);
    list.insert(15);
    list.insert(20);

    // Display the list
    std::cout << "Linked List: ";
    list.display();

    return 0;
}

Popularity 9/10 Helpfulness 3/10 Language cpp

Source: chat.openai.com

Tags: c++ linked-list linked-l

Link to this answer
Share Copy Link

Contributed on Jul 05 2023

Amit Singh

0 Answers Avg Quality 2/10

Linked List C++

Comment

class Node
{
public:
	int data;
	Node *next;
	Node()
	{
		this->data = 0;
		this->next = NULL;
	}
	Node(int data)
	{
		this->data = data;
		this->next = NULL;
	}
	~Node(){
		this->next= NULL;
	
	}
};

Popularity 8/10 Helpfulness 2/10 Language cpp

Source: Grepper

Tags: c++ linked-list linked-l

Link to this answer
Share Copy Link

Contributed on Sep 08 2023

khair muhammad

0 Answers Avg Quality 2/10

C++ linked list

Comment

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */

void trimLeftTrailingSpaces(string &input) {
    input.erase(input.begin(), find_if(input.begin(), input.end(), [](int ch) {
        return !isspace(ch);
    }));
}

void trimRightTrailingSpaces(string &input) {
    input.erase(find_if(input.rbegin(), input.rend(), [](int ch) {
        return !isspace(ch);
    }).base(), input.end());
}

vector<int> stringToIntegerVector(string input) {
    vector<int> output;
    trimLeftTrailingSpaces(input);
    trimRightTrailingSpaces(input);
    input = input.substr(1, input.length() - 2);
    stringstream ss;
    ss.str(input);
    string item;
    char delim = ',';
    while (getline(ss, item, delim)) {
        output.push_back(stoi(item));
    }
    return output;
}

ListNode* stringToListNode(string input) {
    // Generate list from the input
    vector<int> list = stringToIntegerVector(input);

    // Now convert that list into linked list
    ListNode* dummyRoot = new ListNode(0);
    ListNode* ptr = dummyRoot;
    for(int item : list) {
        ptr->next = new ListNode(item);
        ptr = ptr->next;
    }
    ptr = dummyRoot->next;
    delete dummyRoot;
    return ptr;
}

void prettyPrintLinkedList(ListNode* node) {
  while (node && node->next) {
      cout << node->val << "->";
      node = node->next;
  }

  if (node) {
    cout << node->val << endl;
  } else {
    cout << "Empty LinkedList" << endl;
  }
}

int main() {
    string line;
    while (getline(cin, line)) {
        ListNode* head = stringToListNode(line);
        prettyPrintLinkedList(head);
    }
    return 0;
}

Popularity 10/10 Helpfulness 2/10 Language cpp

Source: leetcode.com

Tags: c++

Link to this answer
Share Copy Link

Contributed on Sep 28 2021

8th Hokage

0 Answers Avg Quality 2/10

create linked list in c++

Contents

More Related Answers

create linked list in c++

Closely Related Answers

linked list c++

c++ linked list

Linked list in c++

linked list in c++

Linked List C++

C++ linked list

Grepper

Documentation

Social

Legal

Contact

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