Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //My classes:
- class Node
- {
- int data;
- Node* next;
- public:
- Node();
- void setData(int d);
- void setNext(Node* n);
- int getData();
- Node* getNext();
- };
- class LinkList
- {
- Node* headPtr;
- int listSize;
- int check_Input(string n);
- Node* createNode();
- public:
- LinkList();
- Node* getHeadPtr();
- int getListSize();
- void addNode_start(int x);
- void addNode_end(int x);
- void addNode_middle(int x);
- int search(int key, int pos,Node* temp);
- void Reverse();
- void sortByVal();
- void sortByLink();
- void sortedInsert(int x);
- LinkList& operator=( LinkList &L);
- void print();
- };
- //The functions being called inside my overloaded function:
- void Node::setData(int d)
- {
- data = d;
- }
- void Node::setNext(Node* n)
- {
- next = n;
- }
- int Node::getData()
- {
- return data;
- }
- Node* Node::getNext()
- {
- return next;
- }
- Node* LinkList:: createNode()
- {
- Node *newPtr;
- newPtr = (Node *)malloc(sizeof(Node));
- listSize++;
- return newPtr;
- }
- LinkList& LinkList::operator=(LinkList &L)
- {
- if (this != &L)
- {
- Node* tail = NULL;
- Node* headPtr = NULL;
- Node* curr = L.getHeadPtr();
- while (curr != NULL)
- {
- if (headPtr == NULL)
- {
- headPtr = createNode();
- headPtr->setData(curr->getData());
- headPtr->setNext(NULL);
- tail = headPtr;
- }
- else
- {
- tail->setNext(createNode());
- tail = tail->getNext();
- tail->setData(curr->getData());
- tail->setNext(NULL);
- }
- curr = curr->getNext();
- }
- }
- return *this;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement