LinkedList

#include <iostream>

using namespace std;

class node
{
    int value;
    node* next;

public:
    node(int value, node* next)
    {
        this->value = value;
        this->next = next;
    }

    void print()
    {
        node* current = this;

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

    //Add the value end at the end of the list (i.e. after the last element)
    void add(int n)
    {
        // Your code starts here
        node* append = NULL;
        append->value = n;
        append->next = NULL;

        // Your code ends here
    }

    //Return the sum of all the elements in the list
    int sum()
    {
        // Your code starts here

        // Your code ends here
    }

    //Multiplies each element in the list by n
    void mult(int n)
    {
        // Your code starts here

        // Your code ends here
    }

    //Find the maximum value in the list
    int max()
    {
        // Your code starts here

        // Your code ends here
    }
};

//After