public Node(T value, Node<T> next)
public void SetValue(T value)
public void SetNext(Node<T> next)
return this.next != null;
public override string ToString()
return this.first == null;
return this.first.GetValue();
this.last.SetNext(new Node<T>(x));
this.last = this.last.GetNext();
this.last = new Node<T>(x);
T x = this.first.GetValue();
this.first = this.first.GetNext();
public override string ToString()
Node<T> pos = this.first;
public static Queue<int> Copy(Queue<int> q)
public static int Count(Queue<int> q, int num)
Queue<int> q1=new Queue<int>();
public static Queue<int> QueCouple(Queue<int> q)
Queue<int> newQ=new Queue<int>();
Queue<int> qCopy=Copy(q);
if(Count(qCopy,qCopy.Head())==2)
newQ.Insert(qCopy.Head());
public Appointment(string code,string date,int time,string id,string tel)
public Appointment(Appointment a)
public string GetCode(){return this.code;}
public string GetDate(){return this.date;}
public int GetTime(){return this.time;}
public string GetId(){return this.id;}
public string GetTel(){return this.tel;}
public int GetStatus(){return this.status;}
private Queue<Appointment> yes ;
private Queue<Appointment> maybe;
public void SetYes(Queue<Appointment> yes)
public void SetMaybe(Queue<Appointment> maybe)
public Queue<Appointment> GetYes(){return this.yes;}
public Queue<Appointment> GetMaybe(){return this.maybe;}
public static void Main()