linked list c++

Comment

1

/*
	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

Share

Link to this answer
Share Copy Link

Contributed on Jul 17 2023

Mysterious Macaque

0 Answers Avg Quality 2/10

c++ linked list

Comment

4

#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++

Share

Link to this answer
Share Copy Link

Contributed on Feb 19 2022

rahulsharma

0 Answers Avg Quality 2/10

Linked list in c++

Comment

1

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++

Share

Link to this answer
Share Copy Link

Contributed on Mar 09 2022

Dentetsu

0 Answers Avg Quality 2/10

cpp linked list

Comment

3

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

Popularity 10/10 Helpfulness 3/10 Language cpp

Source: www.bitdegree.org

Tags: c++

Share

Link to this answer
Share Copy Link

Contributed on Apr 19 2021

Zealous Zebra

0 Answers Avg Quality 2/10

linked list in c++

Comment

0

#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 8/10 Helpfulness 2/10 Language cpp

Source: chat.openai.com

Tags: c++ linked-list linked-l

Share

Link to this answer
Share Copy Link

Contributed on Jul 05 2023

Amit Singh

0 Answers Avg Quality 2/10

C++ linked list

Comment

1

/**
 * 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++

Share

Link to this answer
Share Copy Link

Contributed on Sep 28 2021

8th Hokage

0 Answers Avg Quality 2/10

Linked List C++

Comment

0

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

Share

Link to this answer
Share Copy Link

Contributed on Sep 08 2023

khair muhammad

0 Answers Avg Quality 2/10

linkedlist in c++

Comment

0

/* 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 1/10 Language cpp

Source: www.programiz.com

Tags: c++

Share

Link to this answer
Share Copy Link

Contributed on Mar 03 2022

Fair Flatworm

0 Answers Avg Quality 2/10

create linked list in c++

Comment

0

// 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 7/10 Helpfulness 1/10 Language cpp

Source: www.geeksforgeeks.org

Tags: c++ linked-list link

Share

Link to this answer
Share Copy Link

Contributed on Sep 24 2023

Sparkling Sloth

0 Answers Avg Quality 2/10

liked list with c++

Comment

0

#include <bits/stdc++.h> 
using namespace std; 

// عقدة قائمة مترابطة
class Node 
{ 
	public: 
	int data; 
	Node *next; 
}; 

/* إدراج عقدة جديدة في مقدّمة القائمة
باستخدام الإشارة (مؤشر إلى المؤشر) إلى رأس القائمة
والعدد الصحيح المعطى */
void push(Node** head_ref, int new_data) 
{ 
	/* 1. حجز موقع العقدة في الذاكرة */
	Node* new_node = new Node(); 

	/* 2. إضافة البيانات */
	new_node->data = new_data; 

	/* 3. جعل رأس القائمة هو العقدة التالية للعقدة الجديدة */
	new_node->next = (*head_ref); 

	/* 4. تحريك رأس القائمة ليشير إلى العقدة الجديدة */
	(*head_ref) = new_node; 
} 

/* إدراج عقدة بعد العقدة السابقة المعطاة */
void insertAfter(Node* prev_node, int new_data) 
{ 
	/*1. Null التحقق من أنّ العقدة السابقة المعطاة تحمل القيمة */
	if (prev_node == NULL) 
	{ 
		cout<<"the given previous node cannot be NULL"; 
		return; 
	} 

	/* 2. حجز موقع العقدة الجديدة في الذاكرة */
	Node* new_node = new Node(); 

	/* 3. إضافة البيانات */
	new_node->data = new_data; 

	/* 4. جعل العقدة اللاحقة للعقدة الجديدة هي العقدة اللاحقة للعقدة السابقة */
	new_node->next = prev_node->next; 

	/* 5. تحريك العقدة التالية للعقدة السابقة لتصبح العقدة الجديدة */
	prev_node->next = new_node; 
} 

/* إلحاق عقدة جديدة في نهاية القائمة باستخدام
الإشارة (مؤشر إلى مؤشر) إلى رأس القائمة والعدد الصحيح المعطى */

void append(Node** head_ref, int new_data) 
{ 
	/* 1. حجز موقع العقدة الجديدة في الذاكرة */
	Node* new_node = new Node(); 

	Node *last = *head_ref; /* يستخدم في الخطوة 5*/

	/* 2. إدراج البيانات */
	new_node->data = new_data; 

	/* 3. ستكون العقدة الجديدة هي العقدة الأخير في القائمة
	لذا سنجعل العقدة اللاحقة لها هي
	NULL*/
	new_node->next = NULL; 

	/* 4. إن كانت القائمة فارغةً
	ستكون العقدة الجديدة في رأس القائمة*/
	if (*head_ref == NULL) 
	{ 
		*head_ref = new_node; 
		return; 
	} 

	/* 5. وإن لم تكن القائمة فارغة ننقل العقدة الجديدة إلى نهاية القائمة */
	while (last->next != NULL) 
		last = last->next; 

	/* 6. نغير العقدة اللاحقة للعقدة الأخيرة. */
	last->next = new_node; 
	return; 
} 

// تطبع هذه الدالة محتويات القائمة المترابطة
// بدءًا من رأس القائمة
void printList(Node *node) 
{ 
	while (node != NULL) 
	{ 
		cout<<" "<<node->data; 
		node = node->next; 
	} 
} 

// اختبار الدوال السابقة
int main() 
{ 
	/* البدء بقائمة فارغة */
	Node* head = NULL; 
	
	// إدراج العنصر 6
	// لتصبح القائمة بالشكل التالي
    // 6->NULL 
	append(&head, 6); 
	
	// إدراج العنصر 7 في بداية القائمة 
	// فتصبح القائمة بالشكل التالي
    // 7->6->NULL 
	push(&head, 7); 
	
	// إدراج العنصر 1 في بداية القائمة
    // فتصبح القائمة بالشكل التالي
    // 1->7->6->NULL 
	push(&head, 1); 
	
	// إدراج العنصر 4 في نهاية القائمة
    // فتصبح القائمة بالشكل التالي
	append(&head, 4); 
	
	// إدراج العنصر 8 بعد العنصر 7
    // لتصبح القائمة بالشكل التالي
	insertAfter(head->next, 8); 
	
	cout<<"Created Linked list is: "; 
	printList(head); 
	
	return 0; 
}

Popularity 3/10 Helpfulness 1/10 Language cpp

Source: wiki.hsoub.com

Tags: c++ list

Share

Link to this answer
Share Copy Link

Contributed on Jan 07 2024

Attractive Antelope

0 Answers Avg Quality 2/10

linked list c++

Contents

More Related Answers

linked list c++

Closely Related Answers

c++ linked list

Linked list in c++

cpp linked list

linked list in c++

C++ linked list

Linked List C++

linkedlist in c++

create linked list in c++

liked list with c++

Grepper

Documentation

Social

Legal

Contact

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