Linked list delete trouble

Experts Exchange

	[x] Posted via EE Mobile
	Search, ask, and monitor your questions on the go with EE Mobile. Visit Experts Exchange from your mobile device and never be out of touch again.

10/19/2009 at 02:42PM PDT, ID: 24825205 | Points: 125

	[x] Attachment Details

Linked list delete trouble

Asked by Stealthrt in C++ Programming Language, Microsoft Visual C++.Net

Hey all i am in need of some help with getting some nodes deleted. This is the situation:

Right now it only deletes the 1 string i pass to it "deleteItem". However, i wish to delete the next 8 blocks after the "deleteItem".

Say i have this in the list right now.

bob barker is pretty old but still seems to get all the ladies

Now the user would pick "bob" and the code would delete "bob" but leave everything else. I wish to take out "bob, barker, is, pretty, old, but, still, seems, to".

So....
bob <delete>
move to next node..
barker <delete>
move to next node..
is <delete>
...etc etc.

I have attached the 3 txt files of this project along with the code below that is responsible for deleting the node string.

I'm unsure on how to go about doing that. Any help would be great!

David

View the Solution FREE for 30 Days

         
           
             1:
2:
3:
4:
5:
6:
7:
8:
9:
10:
11:
12:
13:
14:
15:
16:
17:
18:
19:
20:
21:
22:
23:
24:
25:
26:
27:
28:
29:
30:
31:
32:
33:
34:
35:
36:
37:
38:
39:
40:
41:
42:
43:
44:
45:
46:
47:
48:
49:
50:
51:
52:
53:
54:
55:
56:
57:
58:
59:
60:
61:
62:
63:
64:
65:
66:
67:
68:
69:
70:
71:
72:
73:
74:
75:
76:
77:
78:
79:
80:
81:
82:
83:
84:
85:
86:
87:
88:
89:
90:
91:
92:
93:
94:
95:
96:
97:
98:
99:
100:
101:
102:
103:
104:

           
           
             Part of unorderedLinkedList.h:
 
template <class Type>
void unorderedLinkedList<Type>::deleteNode(const Type& deleteItem)
{
    nodeType<Type> *current; //pointer to traverse the list
    nodeType<Type> *trailCurrent; //pointer just before current
    bool found;
 
    if (first == NULL)    //Case 1; the list is empty. 
        cout << "Cannot delete from an empty list."
             << endl;
    else
    {
        if (first->info == deleteItem) //Case 2 
        {
            current = first;
            first = first->link;
			nodeType<Type> *next;
			
            count--;
            if (first == NULL)    //the list has only one node
                last = NULL;
 
            delete current;
			
        }
        else //search the list for the node with the given info
        {
            found = false;
            trailCurrent = first;  //set trailCurrent to point
                                   //to the first node
            current = first->link; //set current to point to 
                                   //the second node
 
            while (current != NULL && !found)
            {
                if (current->info != deleteItem) 
                {
                    trailCurrent = current;
                    current = current-> link;
                }
                else
                    found = true;
            }//end while
 
            if (found) //Case 3; if found, delete the node
            {
                trailCurrent->link = current->link;
                count--;
 
                if (last == current)   //node to be deleted 
                                       //was the last node
                    last = trailCurrent; //update the value 
                                         //of last
                delete current;  //delete the node from the list
            }
            else
                cout << "The item to be deleted is not in "
                     << "the list." << endl;
        }//end else
    }//end else
}//end deleteNode
 
 
 
mainfile.cpp:
 
#include <string>
#include "unorderedLinkedList.h"
    
using namespace std;
 
int main()
{
    unorderedLinkedList<string> list1;
    string str;
 
    cout << "Enter 10 strings." << endl; 
 
    for (int i = 0; i < 10; i++)
    {
        cin >> str;
        list1.insertLast(str);
    }
 
    cout << endl;
 
    list1.print();
    cout << endl;
 
    cout << "Enter the string to be "
         << "deleted: ";
    cin >> str;
    cout << endl;
	
    list1.deleteNode(str);
	
    cout << "After deleting " << str << endl;
    list1.print();
    cout << endl;
 
    system("pause");					
}
           
         

Attachments:

linkedList.txt (11 KB) (File Type Details)

linkedList.h

main.txt (1 KB) (File Type Details)

main.cpp

unorderedLinkedList.txt (7 KB) (File Type Details)

unorderedLinkedList.h

20091111-EE-VQP-91 - Hierarchy / EE_QW_3_20080625

1. jkr621,554
2. Infinity08428,105
3. evilrix386,063
4. itsmeandn...345,939
5. mrjoltcola136,370
6. pgnatyuk80,095
7. Zoppo69,160
8. alb6660,430
9. AndyAins...48,452
10. trinitrotolu...48,102
11. DanRollins45,961
12. Let_Me_Be43,756
13. ozo40,128
14. Gideon737,720
15. jaime_oliv...36,480
16. pepr30,816
17. ikework23,327
18. sunnycoder20,168
19. masheik18,698
20. LordOfPo...18,490
21. JohnGaby18,296
22. johnnash...17,769
23. josgood17,000
24. abel16,556
25. Gurudenis16,260

1. jkr7,897,645
2. itsmeandn...2,356,347
3. Infinity081,955,516
4. Axter1,467,234
5. evilrix1,041,001
6. nietod859,677
7. AlexFM732,762
8. DanRollins729,138
9. jaime_oliv...725,383
10. rstaveley524,876
11. grg99392,524
12. efn329,300
13. chensu313,112
14. AlexViroc...263,393
15. Zoppo255,353
16. Salte247,544
17. ikework219,121
18. wayside215,557
19. jhance207,462
20. rajeev_d...207,388
21. ambience183,231
22. AndyAins...183,072
23. sunnycoder180,898
24. bcladd171,128
25. SteH170,387