Complete the remove() function

Overview

  1. Basic Structure
  2. Getting the files
  3. Complete the size() function
  4. Complete the insert() function
  5. Complete the remove() function
  6. Compiling and Testing

Delete a node that stores the "data" passed in the list. Return true if the node was found, false if not.

The traversal and if condition are already done for you.

  1. Edit List.cpp. You will edit List::remove(int data).
  2. Implement the pointer logic in the section of code labeled "PUT CODE HERE". For example, if the linked list is: 
    	m_head -> 1 -> 4 -> 5 -> 7 -> 8 -> NULL
    Lets say you wanted to delete 4. current would stop at the node that has 1. It is your task to delete the Node that has 4 in it and have the 1 Node's next point to the 5 node. Make sure you make the connection between the two surrounding nodes before you delete the middle one!
« Previous
Next »