Purchase Solution

Erase all occurrences of a target in linked list

Not what you're looking for?

Ask Custom Question

Extend the function eraseValue() to erase all occurrences of "target" in the linked list.

template < typename T >
void eraseAll (node * & front, const T& target);

This is the implementation of eraseValue() that must be modified.

{
node< T > *curr = front, *prev = NULL;
bool foundItem = false;

while (curr != NULL && !foundItem )
{
if (curr->nodeValue == target)
{
if (prev == NULL)
{
front = front -> next;
}
else
{
prev->next = curr-> next;
delete curr;
foundItem = true;
}
}
else
{
prev = curr;
curr = curr-> next;
}
}

Purchase this Solution
Solution Summary

The solution first mentions what needs to be modified in eraseValue function to extend it to eraseAll function, and then gives the code for eraseAll function.

Solution Preview

To erase all occurences of "target" in the linked list, you need to make following modifications to the given code.

1. Change "while (curr != NULL && !foundItem )" to "while (curr != NULL)" so that entire linked list is scanned for target value, rather than just stopping after finding first ...

Purchase this Solution
Free BrainMass Quizzes
Basic Computer Terms

We use many basic terms like bit, pixel in our usual conversations about computers. Are we aware of what these mean? This little quiz is an attempt towards discovering that.

Basic Networking Questions

This quiz consists of some basic networking questions.

Word 2010: Table of Contents

Ever wondered where a Table of Contents in a Word document comes from? Maybe you need a refresher on the topic? This quiz will remind you of the keywords and options used when working with a T.O.C. in Word 2010.

Inserting and deleting in a linked list

This quiz tests your understanding of how to insert and delete elements in a linked list. Understanding of the use of linked lists, and the related performance aspects, is an important fundamental skill of computer science data structures.

C++ Operators

This quiz tests a student's knowledge about C++ operators.

View More Free Quizzes
Related BrainMass Solutions

  • Binary Tree Data Structure Questions using C++ and STL

    Traverse the tree, and list the nodes, via an level-order scan A level-order scan means that we process all nodes at a given level before going to the next level.

  • Function Trace

    The expert examines a function trace.

  • Regulatory pressures and risk management system

    A system of identifying and responding to risks is necessary for all businesses to ensure continuity of business functions in the event of one of these occurrences.

  • Iterators

    Implement the function maxLoc(), which returns an iterator pointing at the largest element in a list. //return an iterator pointing to the largest element //in the list.

  • List in C++

    183683 List in C++ Please include the code. Implement, according to the instructions in parts (a) and (b), the fnction count(), which takes item as argument and returns the number of times item occurs in a list.

  • Marketing strategy

    In addition, there will be an "erase" button that can be used to erase burned-in images. Wider viewing angles will be useful to the customer. The Pricing of the Plasma TV will be $655.

  • List Program C++ with multiple operations

    Replace (int) replace the current element with a new value. Erase deletes the current element. Clear makes the list an empty list. Reverse reverses elements in a list. Swap swaps all the elemments of one list with the another list.

  • Polymorphism and abstract classes

    ) public void setHeight(int height) public String toString() public boolean equals(Object other) Since all Figures have a center point, the implementation of the center method in the Figure superclass could contain the logic for moving

  • Calculating Occurrences: Java Programming

    The first column is a list of the distinct array elements; the second column is the count of the number of the occurrences of each element. Sort the list on entries in the first column, largest to smallest.

View More Related Solutions