Linked List in C/C++/java/Python

#include<iostream>
using namespace std;
class Node
{
    public:
    int data;
    Node *next;
};
void insertFirst (Node **head, int data)
{
    Node *newnode = new Node();
    newnode->data = data;
    newnode->next = *head;
    *head = newnode;
}
void printList(Node *head)
{
    while(head != NULL)
    {
        cout<<head->data<<" ";
        head = head->next;
    }
}
int main()
{
    Node *head = NULL;
    insertFirst(&head, 1);
    insertFirst(&head, 2);
    insertFirst(&head, 3);
    insertFirst(&head, 4);
    insertFirst(&head, 5);
    printList(head);
    return 0;
}

#include<iostream>
using namespace std;
class Node
{
    public:
    int data;
    Node *next;
};
void insertLast(Node **head, int data)
{
    Node *newnode = new Node();
    newnode->data = data;
    newnode->next = NULL;
    if (*head == NULL) {
        *head = newnode;
    } else {
        Node *temp = *head;
        while (temp->next != NULL) {
            temp = temp->next;
        }
        temp->next = newnode;
    }
}
void printList(Node *head)
{
    Node *tnode = head;
    while (tnode != NULL) {
        cout << tnode->data << " ";
        tnode = tnode->next;
    }
}
int main()
{
    Node *head = NULL;
    insertLast(&head, 1);
    insertLast(&head, 2);
    insertLast(&head, 3);
    insertLast(&head, 4);
    insertLast(&head, 5);
    printList(head);
    return 0;
}

#include<iostream>
using namespace std;
class Node
{
public:
    int data;
    Node *next;
    Node(int data)
    {
        this->data = data;
        this->next = NULL;
    }
};
class LLLast
{
public:
    Node *head;
    LLLast()
    {
        head = NULL;
    }
    void insert(int data)
    {
        Node *newNode = new Node(data);
        if (head == NULL)
        {
            head = newNode;
        }
        else
        {
            Node *last = head;
            while (last->next != NULL)
            {
                last = last->next;
            }
            last->next = newNode;
        }
    }
    void insertAt(int data, int index)
    {
        Node *newNode = new Node(data);
        Node *temp = head;
        int count = 0;
        while (count != index - 1)
        {
            temp = temp->next;
            count++;
        }
        newNode->next = temp->next;
        temp->next = newNode;
    }
    void print()
    {
        Node *current = head;
        while (current != NULL)
        {
            cout << current->data << " ";
            current = current->next;
        }
    }
};
int main()
{
    LLLast list;
    list.insert(1);
    list.insert(2);
    list.insert(3);
    list.insertAt(6, 2);
    list.print();
    return 0;
}

#include<iostream>
#include<list>
using namespace std;
int main()
{
    // Declaring list
    list<string> list;
    list.push_back("CodeXam");
    list.push_back("is");
    list.push_back("Best");
 
    // Displaying the list
    cout << "List: ";
 
 
    for (auto it = list.begin(); it != list.end(); it++)
        cout << *it << " ";
    cout << endl;
 
    // Adding an element to the first position
    list.push_front("Hello");
    //Displaying the list after adding the element
    cout << "List after adding the element at the first position: ";
 
 
    for (auto it = list.begin(); it != list.end(); it++)
        cout << *it << " ";
 
 
    cout << endl;
 
    // Adding an element to the last position
 
    list.push_back("Java");
    //Displaying the list after adding the element
    cout << "List after adding the element at the last position: ";
 
    for (auto it = list.begin(); it != list.end(); it++)
        cout << *it << " ";
 
    cout << endl;
 
 
    // Adding an element to the specified position
 
    auto it = list.begin();
    advance(it, 2);
 
    list.insert(it, "Programming");
    //Displaying the list after adding the element
    cout << "List after adding the element at the specified position: ";
 
 
    for (auto it = list.begin(); it != list.end(); it++)
        cout << *it << " ";
 
    cout << endl;
 
    return 0;
 
 
}
 

#include<iostream>
using namespace std;
class Node
{
    public:
    int data;
    Node *next;
    Node(int d)
    {
        data=d;
        next=NULL;
    }
};
 
void removeFirstNode(Node *&head)
{
    if(head==NULL)
    {
        return;
    }
    Node *temp=head;
    head=head->next;
    delete temp;
}
 
void traverse(Node *head)
{
    while(head!=NULL)
    {
        cout<<head->data<<" ";
        head=head->next;
    }
}
 
int main()
{
    Node *head=new Node(1);
    head->next=new Node(2);
    head->next->next=new Node(3);
    head->next->next->next=new Node(4);
    head->next->next->next->next=new Node(5);
    head->next->next->next->next->next=new Node(6);
    removeFirstNode(head);
    traverse(head);
    return 0;
}

 
#include<iostream>
using namespace std;
class Node
{
    public:
    int data;
    Node *next;
    Node(int d)
    {
        data=d;
        next=NULL;
    }
};
 
void removeLastNode(Node *head)
{
    Node *temp=head;
    while(temp->next->next!=NULL)
    {
        temp=temp->next;
    }
    temp->next=NULL;
}
 
 
 
void push(Node **head,int new_data)
{
    Node *new_node=new Node(new_data);
    new_node->next=*head;
    *head=new_node;
}
 
void printList(Node *head)
{
    Node *tnode=head;
    while(tnode!=NULL)
    {
        cout<<tnode->data<<" ";
        tnode=tnode->next;
    }
    cout<<endl;
}
 
int main()
{
    Node *head=NULL;
    push(&head,1);
    push(&head,2);
    push(&head,3);
    push(&head,4);
    push(&head,5);
 
    cout<<"Created Linked list is: ";
    printList(head);
 
    removeLastNode(head);
 
    cout<<"Linked List after deletion of last node: ";
    printList(head);
 
    return 0;
}
 
 

#include<iostream>
using namespace std;
class Node
{
    public:
    int data;
    Node *next;
    Node(int d)
    {
        data=d;
        next=NULL;
    }
};
 
void removeAtSpecificIndex(Node *head,int index)
{
    Node *temp=head;
    Node *prev=NULL;
    int count=0;
    while(temp!=NULL)
    {
        if(count==index)
        {
            prev->next=temp->next;
            delete temp;
            return;
        }
        prev=temp;
        temp=temp->next;
        count++;
    }
}
 
void push(Node **head,int new_data)
{
    Node *new_node=new Node(new_data);
    new_node->next=*head;
    *head=new_node;
}
 
void printList(Node *head)
{
    Node *tnode=head;
    while(tnode!=NULL)
    {
        cout<<tnode->data<<" ";
        tnode=tnode->next;
    }
    cout<<endl;
}
 
int main()
{
    Node *head=NULL;
    push(&head,1);
    push(&head,2);
    push(&head,3);
    cout<<"Created Linked list is: ";
    printList(head);
    removeAtSpecificIndex(head,1);
    cout<<"Linked List after Deletion at index 1: ";
    printList(head);
    return 0;
}
 
 

#include<iostream>
#include<list>
using namespace std;
int main()
{
    // Add elements to the linked list
 
    list<string> list;
    list.push_back("CodeXam");
    list.push_back("is");
    list.push_back("Best");
    list.push_back("for");
    list.push_back("Developers");
 
    // Displaying the linked list
    cout << "Linked list: ";
    for (auto it = list.begin(); it != list.end(); it++)
        cout << *it << " ";
 
    // Removing an element at first position
    list.pop_front();
 
    // Displaying the linked list
    cout << " "
 
         << "Linked list after removing first element: ";
    for (auto it = list.begin(); it != list.end(); it++)
 
        cout << *it << " ";
 
    // Removing an element at last position
 
    list.pop_back();
 
    // Displaying the linked list
    cout << " "
 
         << "Linked list after removing last element: ";
    for (auto it = list.begin(); it != list.end(); it++)
 
        cout << *it << " ";
 
    // Removing an element at specified position
 
    list.remove("Best");
 
    // Displaying the linked list
    cout << " "
 
         << "Linked list after removing 3rd element: ";
    for (auto it = list.begin(); it != list.end(); it++)
 
        cout << *it << " ";
 
    return 0;
 
}