View difference between Paste ID: Gd34mFLC and etg3s0Cj

 /* -------------------------- myNode.h  ---------------------------*/
 #include <iostream>
 #ifndef myNode_h
 #define myNode_h
 
 class Node {
 	friend void printN(Node &);
- friend class Queue;
+
 	char *clientName;
 	double clientState;
 	Node *next;
 
 public:
 	Node();
 	Node(char *, int);
 	void setName(const char *);
 	void setState(const double);
 	void setNext(Node *);
 	char* getName() const;
 	double getState() const;
 	Node * getNext() const;
 	~Node();
 };
 
 
 #endif
 
 
 
 
 
 /* -------------------------- myQueue.h  ---------------------------*/
 #include <iostream>
 
 
 #ifndef myQueue_h
 #define myQueue_h
 
 class Queue {
 	friend void printQ(Queue &);
-private :
+
 	Node* head;
 	Node* tail;
 
 public:
 
 	Queue();
 	void insertNode(Node &);
 	void deQueue();
 	Node *getLast();
 	Node *peek();
 	bool isEmpty();
 
-	void printQ();
+
 #endif
 
 
 
 
 /* -------------------------- myNode.cpp  ---------------------------*/
 #include <iostream>
 #include "myNode.h"
 #include "myQueue.h"
 #include <cstring>
 using namespace std;
 
 Node :: Node()
 {
 	this->clientName = NULL;
 	this->clientState=0;
 	this->next=NULL;
 }
 
 Node :: ~Node()
 {
 	delete []clientName;
 }
-  if(this)
+
-  {
+
-	  this->clientName = NULL;
+
 	strcpy(clientName,name);
 	this->clientState = state;
-  }
+
 }
 
 
 void  Node::setName (const char *name)
 {
 	strcpy(clientName,name);
 }
 
 
 void  Node ::setState(const double state)
 {
 	this->clientState = state;
 }
 
 void  Node ::setNext(Node *next)
 {
 	this->next=next;
 }
 
 char* Node :: getName() const
 {
 	return (this->clientName);
 }
 
 double Node :: getState() const
 {
 	return (this->clientState);
 }
 
 Node * Node :: getNext() const
 {
 	return (this->next);
 }
 
 void printN(Node &n1)
 {
 	cout << "Client Name: "<< n1.clientName;
 	cout << " Client State: "<<n1.clientState << "$" << endl ;
 }
 
 
 
 /* -------------------------- myQueue.cpp  ---------------------------*/
 
 #include <iostream>
 using namespace std;
 #include "myNode.h"
 #include "myQueue.h"
 using namespace std;
 
 Queue :: Queue()
 {
     head=NULL;
 	tail=NULL;
 }
 
 void Queue :: insertNode(Node &n1)
 {
 	if (head == NULL)
-		tail->next=&n1;
+
        head=&n1;
 	}
 	else
 	{
 		tail->setNext(&n1);
 	}
 	tail=&n1;
 }
 
 void Queue :: deQueue()
 {
 	Node *myHead=head;
 	if(!head)
 	{
 		cout<< "The Queue is empty" <<endl;
 	}
 	else
 	{
 	if(myHead == tail) //Special case if the queue had only 1 client
-	head = head->next;
+
 		tail=NULL;
 		head=NULL;
 	}
 	else
 		head = head->getNext();
 	}
 }
 
 Node * Queue :: getLast()
 {
 	Node *myHead=head;
 	if(!head)
 	{
 		cout<< "The Queue is empty" <<endl;
     return NULL;
 	}
 	if(myHead == tail) //Special case if the queue had only 1 client
-	head = head->next;
+
 		tail=NULL;
 		head=NULL;
 	}
 	else
 		head = head->getNext();
 	return myHead;
 }
 
 
 Node * Queue :: peek()
 {
 	return this->head;
 }
 
 
 bool Queue ::  isEmpty()
 {
-void Queue :: printQ()
+
 		return true;
-	Node *location=head;
+
 }
 
 void printQ(Queue &Q)
 {
 	Node *location=Q.head;
 
 	if (!location)
 	{
-		cout << "Client Name: "<< location->clientName;
+
-		cout << " Client State: "<<location->clientState << "$" << endl ;
+
-		location=location->next;
+
 	while (location !=NULL)
 	{
 		printN(*location);
 		location=location->getNext();
 	}
 }
 
 
 
 
 /* ------------------------------------------ main.cpp --------------------------------------------------*/
 #include <iostream>
 #include "myNode.h"
 #include "myQueue.h"
 
 using namespace std;
 
 void main ()
 {
 	Queue q1;
  Node n1("Jack",210),n2("Austin",15),n3("Steve",32),n4("Sean",312);
  Node * last, *peek;
  q1.insertNode(n1);
- q1.printQ();
+
  q1.insertNode(n3);
  printQ(q1);
  if(!q1.isEmpty())
  {
  peek=q1.peek();
- q1.printQ();
+
  }
  printQ(q1);
- q1.printQ();
+
  cout << "the node that was dequeued is " << last->getName()<<" " << last->getState() <<endl ;
- q1.printQ();
+ printQ(q1);
  q1.deQueue();
  printQ(q1);
  q1.deQueue();
  if(q1.isEmpty())
- q1.printQ();
+
  q1.insertNode(n4);
  printQ(q1);
 }