// May need a second function
// Index is the position number of the node
Node* find_node_of_max_element(Node* current_pointer)
{
    if (current_pointer == nullptr)
        return nullptr;

    Node* max_element_except_first = find_node_of_max_element(current_pointer->next);

    if (max_element_except_first == nullptr)
        return current_pointer;

    return current_pointer->value > max_element_except_first->value ? current_pointer : max_element_except_first;
}

int find_node_index_of_max_element(Node* current_pointer)
{
    Node* max_node = find_node_of_max_element(current_pointer);

    if (max_node == nullptr)
        return arbitrary_low_number;

    if (current_pointer->value == max_node->value)
        return 0;

    else
        find_node_index_of_max_element(current_pointer->next) + 1;
}