public:
List(); //constructor
~List(); //deconstructor
- void insertAtFront( const T & );
- void insertAtBack( T *&);
+ T *insertAtFront( const T & );
+ T *insertAtBack( T *&);
+ ListNode<T> *insertAtBack_RLN( T *&);
bool removeFromFront( T & );
bool removeFromBack( T & );
bool del( T *);
}
template<class T>
-void List<T>::insertAtFront( const T &value )
+T *List<T>::insertAtFront( const T &value )
{
ListNode<T> *newPtr = getNewNode ( value );
firstPtr->prev = newPtr;
firstPtr = newPtr;
}
+ return firstPtr->getData();
}
template<class T>
-void List<T>::insertAtBack(T *&value )
+T *List<T>::insertAtBack(T *&value )
{
ListNode<T> *newPtr = getNewNode(*value);
lastPtr->next = newPtr;
lastPtr = newPtr;
}
+ return lastPtr->getData();
+}
+
+template<class T>
+ListNode<T> *List<T>::insertAtBack_RLN(T *&value )
+{
+ ListNode<T> *newPtr = getNewNode(*value);
+
+ if (isEmpty())
+ {
+ firstPtr = lastPtr = newPtr;
+ }
+ else
+ {
+ newPtr->prev = lastPtr;
+ lastPtr->next = newPtr;
+ lastPtr = newPtr;
+ }
+ return lastPtr;
}
currentPtr = firstPtr;
while (currentPtr)
{
+ cout << currentPtr->getData() << endl << value << endl;
if (currentPtr->getData() == value)
return currentPtr;
currentPtr = currentPtr->Next();