linked list

[Bassam300]

Write program to delete each node, if has a repeated value

#include <iostream>
using namespace std;

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

list *head = NULL;
void add2List(list *node2List)
{
    node2List->next = head;
    head = node2List;
}

void remove()
{
    list *root = head;
    list *afterRoot = root->next;
    list *bf_root = root;
    while(root)
    {
        while(afterRoot)
        {
            if(afterRoot->data == root->data)
            {
                list *delNode = afterRoot;
                afterRoot = afterRoot->next;
                bf_root->next = afterRoot;
                delete delNode;
            }

            else
            {
                bf_root = afterRoot;
                afterRoot = afterRoot->next;
            }
        }
    root = root->next;
    }
}

int main()
{
    list *node;
    int val;

    cout << "Adding values to list :\n";
    cout << ">>";
    while(cin >> val)
    {
        cout << ">>";
        node = new list;
        node->data = val;
        node->next = NULL;
        add2List(node);
    }

    remove();

    list *temp = head;
    while(temp)
    {
        cout << temp->data << " ";
        temp = temp->next;
    }
    return 0;
}

It works good with me

What I want is your suggestions in this code and also if possible to give me advice that can help to be my code more effective in the future .

sorry for my bad english

[firedraco]

Instead of using a global variable and functions that modify it, make functions that take the list they are modifying as an argument.

Even better, make the functions part of the structure as member functions.

[Bassam300]

@firedraco

thank u so much