LinkedQueue的实现

LinkedQueue的实现

ic class LinkedQueue

{

private class Node

{

public object Data;

public Node Link;

}

private Node front;

private Node rear;

public LinkedQueue()

{

}

public bool IsEmpty

{

get

{

return front == null;

}

}

public bool IsFull

{

get

{

Node p;

try

{

p = new Node();

return false;

}

catch

{

return true;

}

}

}

public object First

{

get

{

if(IsEmpty)

{

throw new Exception("Queue is empty.");

}

return front.Data;

}

}

public object Last

{

get