public class Queue {
private QueueNode front;
private QueueNode rear;
public Queue() {
front = null;
rear = null;
}
public void insert(int value) {
QueueNode newNode = new QueueNode();
newNode.value = value;
if (isEmpty()) {
front = newNode;
rear = newNode;
} else {
rear.link = newNode;
rear = newNode;
}
}
public boolean remove() {
if (isEmpty()) {
return false;
} else {
front.link = front;
if (front == null)
rear = null;
return true;
}
}
public int peek() {
if (isEmpty())
return 0;
else
return front.value;
}
public boolean isEmpty() {
return (front == null);
}
public class QueueNode {
QueueNode link;
int value;
}
}
private QueueNode front;
private QueueNode rear;
public Queue() {
front = null;
rear = null;
}
public void insert(int value) {
QueueNode newNode = new QueueNode();
newNode.value = value;
if (isEmpty()) {
front = newNode;
rear = newNode;
} else {
rear.link = newNode;
rear = newNode;
}
}
public boolean remove() {
if (isEmpty()) {
return false;
} else {
front.link = front;
if (front == null)
rear = null;
return true;
}
}
public int peek() {
if (isEmpty())
return 0;
else
return front.value;
}
public boolean isEmpty() {
return (front == null);
}
public class QueueNode {
QueueNode link;
int value;
}
}
'프로그래밍 > 알고리즘' 카테고리의 다른 글
이진트리(BinaryTree) (0) | 2017.02.24 |
---|---|
quickSort (0) | 2017.02.24 |
binarySearch (0) | 2017.02.24 |
Stack(TwoStack) (0) | 2017.02.24 |
Stack(getMin) (0) | 2017.02.24 |