Data Structures Implementation

Module 1: An array-based implementation of the stack

A stack is a Last In First Out data structure. The last item added to the stack is placed on top and accessed first. The insertion and removal of items are done in reverse order.

The programs (Stack.java, StackAr.java, TestStackAr.java) to implement the stack are shown here.

Compile the source programs and test them.

Module 2: A linked-list-based implementation of the stack

The programs (Stack.java, ListNode.java, StackLi.java, TestStackLi.java) to implement the stack are shown here.

Compile the source programs and test them.

Module 3: An array-based implementation of the queue

A queue is a First In First Out data structure. Items are taken out of the queue in the same order that they were put into the queue. An item is inserted at one end (called the rear) and removed at the other end (called the front).

The programs (Queue.java, QueueAr.java, TestQueueAr.java) to implement the queue are shown here.

Compile the source programs and test them.

Module 4: A linked-list-based implementation of the queue

The programs (Queue.java, ListNode.java, QueueLi.java, TestQueueLi.java) to implement the queue are shown here.

Compile the source programs and test them.