coupling an int and string together in a node, linkedlist

[Diedes]

Hey,
What this program does (the main), is read a txt file and create a node for every line with a for loop. For example
line1
line2
line3

They are all diffrent lines, thus diffrent nodes.
However, what I really want is to pick a random line and display it, after that it depends on the answer of the user wether the line is removed or not.

Now what I wanted to do is, create a random number, couple this number to a line, so
1. line1
2. line2
3. line3

Randomize the number and when for example number 2 is picked, I can print line2.
But this doesnt work, since number 2 is not coupled to line 2.

So to fix my problem: I need to couple number 2 to line2, number 3 to line3 etc, OR find a way to randomize strings without using int at all.

Though I have troubles with both :P

Here is my entire code, have a look if you want. The linkedlist I mainly got from internet, since I'm still learning to write my own :)

Thanks

#include <iostream>
#include <cstddef>
#include <fstream>
#include <string>
#include <stdio.h>      /* printf, scanf, puts, NULL */
#include <stdlib.h>     /* srand, rand */
#include <time.h>       /* time */

using namespace std;




/* definition of the list node class */
class Node
{
    friend class LinkedList;
private:
    string _value;
	int _waarde; /* data, can be any data type, but use integer for easiness */
    Node *_pNext; /* pointer to the next node */
    
public:
    /* Constructors with No Arguments */
    Node(void)
    : _pNext(NULL)
    { }
    
    /* Constructors with a given value */
    Node(string line,int ID)
    : _value(line), _waarde(ID), _pNext(NULL)
    { }
    
    /* Constructors with a given value and a link of the next node */
    Node(string line, int ID, Node* next)
    : _value(line), _waarde(ID), _pNext(next)
    {}
    
    /* Getters */
    string getValue(void)
    { return _value; }

	int getWaarde(void)
	{ return _waarde; } 
		    
    Node* getNext(void)
    { return _pNext; }
};

/* definition of the linked list class */
class LinkedList
{
private:
    /* pointer of head node */
    Node *_pHead;
    /* pointer of tail node */
    Node *_pTail;
    
public:
    /* Constructors with a given value of a list node */
    LinkedList(string line, int ID);
    /* Destructor */
    ~LinkedList(void);
    
    /* Function to append a node to the end of a linked list */
    void tailAppend(string line, int ID);
    
    
    /* Remove a node with a specific value if it exists */
    void remove(string line, int ID);
    
    
    /* Traversing the list and printing the value of each node */
    void traverse_and_print();
    
    void print(string line, int ID);
};

LinkedList::LinkedList(string line, int ID)
{
    /* Create a new node, acting as both the head and tail node */
    _pHead = new Node(line, ID);
    _pTail = _pHead;
}

LinkedList::~LinkedList()
{
    /*
     * Leave it empty temporarily.
     * It will be described in detail in the example "How to delete a linkedlist".
     */
}

void LinkedList::tailAppend(string line, int ID)
{
    /* The list is empty? */
    if (_pHead == NULL) {
        /* the same to create a new list with a given value */
        _pTail = _pHead = new Node(line, ID);
    }
    else
    {
        /* Append the new node to the tail */
        _pTail->_pNext = new Node(line, ID);
        /* Update the tail pointer */
        _pTail = _pTail->_pNext;
    }
}  

void LinkedList::remove(string line, int ID)
{
    Node *pPre = NULL, *pDel = NULL;
    
    /* Check whether it is the head node?
     if it is, delete and update the head node */
    if (_pHead->_waarde == ID) {
        /* point to the node to be deleted */
        pDel = _pHead;
        /* update */
        _pHead = pDel->_pNext;
        delete pDel;
        return;
    }
    
    pPre = _pHead;
    pDel = _pHead->_pNext;
    
    /* traverse the list and check the value of each node */
    while (pDel != NULL) {
        if (pDel->_waarde == ID) {
            /* Update the list */
            pPre->_pNext = pDel->_pNext;
            /* If it is the last node, update the tail */
            if (pDel == _pTail) {
                _pTail = pPre;
            }
            delete pDel; /* Here only remove the first node with the given value */
            break; /* break and return */
        }
        pPre = pDel;
        pDel = pDel->_pNext;
    }
}

void LinkedList::traverse_and_print()
{
    Node *p = _pHead;
    
    /* The list is empty? */
    if (_pHead == NULL) {
        cout << "The list is empty" << endl;
        return;
    }
    
     cout << "LinkedList: ";
    /* A basic way of traversing a linked list */
    while (p != NULL) { /* while there are some more nodes left */
        /* output the value */
        cout << p->_value << " ";
        /* The pointer moves along to the next one */
        p = p->_pNext;
    }
    cout << endl;
}

void LinkedList::print(string line, int ID)
{
	
		ID = 5;
	cout <<"Line " << line << "ID: "<< ID << "\n";
	
	
}

int main(int argc, const char * argv[])
{
	
	
	string line;
	int ID;
   
    LinkedList list(line, ID);
    
    
    

    
    
      
  ifstream myfile("gd.txt");
         
  for(int ID=1;true;ID++)
  {

  	if(!myfile.eof()){          
    getline(myfile,line,'\n');
    cout<<ID<<". "<<line<<"\n";
    list.tailAppend(line, ID);
    }
  	else{
	  break;
	}
	}
	ID = 9;
	cout << ID << line; // It outputs 9Line32
		list.print(line, ID); // It outputs 5Line32, atleast not 9
		
		 // I want as output 9Line9 when I print it.
    


	
	
      
	
    

    
    cout << "Before removing: " << endl; 
    /* output the result */
    list.traverse_and_print();
    
    /* Remode the node with value 3 */
    cout << "Trying to remove the node with value "<< line << endl;
    list.remove(line, 3);
    /* output the result */
    cout << "After removing: " << endl;
    list.traverse_and_print();

    return 0;
}