Data Structures in Java

Linked List :

Operations implemented in the above Linked_List.java program are :

• Insert Begining  :  which inserts an element at the begining of the linked list.
• Insert Ending  :  which inserts an element at the end of the linked list.
• Insert Position  :  which inserts an element at the required position of the linked list.
• Delete Begining  :  which deletes the element at the begining of the linked list.
• Delete Ending  :  which deletes the element at the end of the linked list.
• Delete Position  :  which deletes the element at the required position of the linked list.
• Delete Element  :  which deletes the particular element of the linked list.
• Display  :  displays the linked list.
• Length  :  return length of the linked list.

Stack Implementation using Array :

Since, we have used array for implementation of stack, the size of the stack is static.

Operations implemented in the above Stack_using_array.java program are :

• Push  :  which inserts an element into the stack.
• Pop  :  which removes the top element from the stack.
• Display  :  which displays the stack.
• Peek  :  which returns the top element of the stack.

Stack Implementation using Linked List :

Since, we have used linked list for implementation of stack, the size of the stack is dynamic.

Operations implemented in the above Stack_using_linkedlist.java program are :

• Push  :  which inserts an element into the stack.
• Pop  :  which removes the top element from the stack.
• Display  :  which displays the stack.
• Peek  :  which returns the top element of the stack.

Queue and Circular Queue Implementation using Array :

Operations implemented in the above queue.java and Circular_queue.java program are :

• Enqueue  :  which adds an element into the queue.
• Dequeue  :  which removes the element from the queue.
• Display  :  which displays the queue.