Data Structure In Java: Dynamic Queue
luthfisauqi17
Posted on November 10, 2021
import java.util.EmptyStackException;
public class QueueDynamic<T> {
private class QueueNode {
private T data;
private QueueNode next;
private QueueNode(T data) {
this.data = data;
this.next = null;
}
}
private QueueNode first;
private QueueNode last;
public QueueDynamic() {
this.first = this.last = null;
}
public QueueDynamic(T data) {
this.first = this.last = new QueueNode(data);
}
public void add(T data) {
QueueNode temp = new QueueNode(data);
if (this.last != null) {
this.last.next = temp;
}
last = temp;
if (this.first == null) {
this.first = this.last;
}
}
public T remove() {
if (first == null) throw new EmptyStackException();
T data = this.first.data;
this.first = this.first.next;
if (this.first == null) {
this.last = null;
}
return data;
}
public T peek() {
if (first == null) throw new EmptyStackException();
return this.first.data;
}
public boolean isEmpty() {
return this.first == null;
}
}
Sources and Images:
💖 💪 🙅 🚩
luthfisauqi17
Posted on November 10, 2021
Join Our Newsletter. No Spam, Only the good stuff.
Sign up to receive the latest update from our blog.
Related
undefined I absolutely love when CSS gets new features (Even though it usually takes me years to remember to use them 😄)
November 27, 2024