C++ Data Structures and Algorithms

Removing an item from the LinkedList ADT

Similar to the inserting operation, the removing operation also has several cases, and they are:

1. The removed item is in the Head, which is index = 0
2. The removed item is in the Tail, which is index = N-1
3. The removed item is in the other position of the linked list, where index = 1 to N-2

For case 1, the implementation is straightforward. We just need to point the Head pointer to the node which is pointed by the Next pointer of the current Head (in other words, the second element) and delete the first element of the linked list. Please see the following code:

template <typename T>void LinkedList<T>::RemoveHead(){    // Do nothing if list is empty    if(m_count == 0)        return;    // Save the current Head // to ...