#include <iostream>
using namespace std;

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

class linklist {
private:
    node* head;

public:
    linklist() {
        head = nullptr;
    }

    void insert(int value) {
        node* newnode = new node;

        newnode->value = value;
        newnode->next = nullptr;

        // If the list is empty
        if (head == nullptr) {
            head = newnode;
        }
        else {
            node* temp = head;

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

            temp->next = newnode;
        }
    }

    void traverse() {
        node* temp = head;

        while (temp != nullptr) {
            cout << temp->value << " ";
            temp = temp->next;
        }

        cout << endl;
    }
};

int main() {
    linklist list;

    list.insert(10);
    list.insert(20);

    list.traverse();

    return 0;
}