Homework answers / question archive / write code and give me answer code in text which i can copy on my ide /////////////////////////////////////////////////////////////////////////////////////////////////////////////// Singly Circular Linked List //////////////////////////////////////////////////////////////////////////////////////////////////////   template<typename T> class Node { public: // constructor Node(T element); //sets the KeyType data in the Node void setData(T pVal); // returns the KeyType data in the Node T getData(); // returns the link to the next node Node* GetNext(); // sets the link to the next node void SetNext(Node *x); private:  T data;  Node *link; }; template <typename T> class SCList {public: // constructor of the Singly Circular Linked List SCList(); /*Inserts the node pNew after the node pBefore if the list is empty, it makes pNew the first node of the list*/ void Insert(Node<T>* pBefore, Node<T>* pNew); //Deletes the node pToBeDeleted void Delete(Node<T>* pToBeDeleted); //prints the contents of the list void printList(); private:  Node<T> *last ; };

write code and give me answer code in text which i can copy on my ide /////////////////////////////////////////////////////////////////////////////////////////////////////////////// Singly Circular Linked List //////////////////////////////////////////////////////////////////////////////////////////////////////   template<typename T> class Node { public: // constructor Node(T element); //sets the KeyType data in the Node void setData(T pVal); // returns the KeyType data in the Node T getData(); // returns the link to the next node Node* GetNext(); // sets the link to the next node void SetNext(Node *x); private:  T data;  Node *link; }; template <typename T> class SCList {public: // constructor of the Singly Circular Linked List SCList(); /*Inserts the node pNew after the node pBefore if the list is empty, it makes pNew the first node of the list*/ void Insert(Node<T>* pBefore, Node<T>* pNew); //Deletes the node pToBeDeleted void Delete(Node<T>* pToBeDeleted); //prints the contents of the list void printList(); private:  Node<T> *last ; };

Computer Science

Share With

---

write code and give me answer code in text which i can copy on my ide

///////////////////////////////////////////////////////////////////////////////////////////////////////////////

Singly Circular Linked List

//////////////////////////////////////////////////////////////////////////////////////////////////////

 

template<typename T>

class Node

{ public:

// constructor

Node(T element);

//sets the KeyType data in the Node

void setData(T pVal);

// returns the KeyType data in the Node

T getData();

// returns the link to the next node

Node* GetNext();

// sets the link to the next node

void SetNext(Node *x);

private:

 T data;

 Node *link;

};

template <typename T>

class SCList

{public: // constructor of the Singly Circular Linked List

SCList();

/*Inserts the node pNew after the node pBefore

if the list is empty, it makes pNew the first node of the list*/

void Insert(Node<T>* pBefore, Node<T>* pNew);

//Deletes the node pToBeDeleted

void Delete(Node<T>* pToBeDeleted);

//prints the contents of the list

void printList();

private:

 Node<T> *last ;

};