CS301 Data Structures Assignment No 01 idea solution spring 2011

[Vuhelper]

[size=10][COLOR="rgb(139, 0, 0)"]full solution in attachment [/COLOR][/SIZE]

Header File Source

#ifndef LINKEDLIST_H
#define LINKEDLIST_H
#include <i ostream>
using name space std;
template <class T>
class LList

{
Private:
class ListNode
{
friend class LList<T>;
T value;
ListNode *nest;
ListNode(T value1, ListNode *next1=NULL)

{
value=value1;
next=next;
}
};
ListNode *head;
public:
LList()
{
head=NULL;
)
~LList();
void appendNode(T);
void insertNode(T);
void deleteNode();
voide displayList();
void MoveNext();
void ShowCurrent();
};

template<class T>
voidLList<T>::appendNode(T val)
{
if(head=NULL)
head=new ListNode(val);
else
{
ListNode *nodePtr;

while (nodePtr->next !=NULL)

nodePtr->next=new ListNode(val);
}
}


template<class T>
voidLList<t>::displayList()
{
ListNode *nodePtr;
nodePtr =head;
while (nodePtr)
{
cout << nodePtr->value << endl;
nodePtr =nodePtr->next;
}
}

template<class T>
voidLList<T>::ShowCurrent()
{
ListNode *nodePtr;
nodePtr=head;
count<<nodePtr->value<< endl;
}

template<class T>
voidLList<T>::MoveNext()
{
ListNode *nodePtr;
nodePtr=head;
while (nodePtr)
{
nodePtr = nodePtr->next;
}
}

template<class T>
voidLList<T>::insertNode(T val)