Linked List Q Data Structure
b
c
d
e
f
front
back
void enqueue(Object x) {
if (is_empty())
front = back = new Node(x)
else
back->next = new Node(x)
back = back->next
}
Object dequeue() {
assert(!is_empty)
return_data = front->data
temp = front
front = front->next
delete temp
return temp->data
}
bool is_empty() {
return front == null
}
Previous slide
Next slide
Back to first slide
View graphic version