Tag Archives: DSF

Implementation of Stack using Linked List in Java

In computer science, a stack or LIFO (last in, first out) is an abstract data type that serves as a collection of elements, with two principal operations: push adds an element to the collection; pop removes the last element that was added. (Via Wikipedia)

Here is java code for implementation of stack using linked list in java.

Continue reading Implementation of Stack using Linked List in Java

Implementing Circular Queue in Java with Arrays

A circular queue is an abstract data type that contains a collection of data which allows addition of data at the end of the queue and removal of data at the beginning of the queue. Circular queues have a fixed size.

Circular queue follows FIFO principle. Queue items are added at the rear end and the items are deleted at front end of the circular queue.

Continue reading Implementing Circular Queue in Java with Arrays

Implementing Doubly Linked List in Java

doubly-linked list is a linked data structure that consists of a set of sequentially linked records called nodes. Each node contains two fields, called links, that are references to the previous and to the next node in the sequence of nodes.

DLL
A doubly-linked list whose nodes contain three fields: an integer value, the link to the next node, and the link to the previous node.

The two node links allow traversal of the list in either direction. Here is java implementation of DLL.

Continue reading Implementing Doubly Linked List in Java