Data structures implemented in Java programming language.
Stack, Queue and BinSearch classes are dependent on the Node class
BST is dependent on the BSTNode class
DQueue is dependent on the DNode class
To implement stack, run the main() of Stack
To implement queue, run the main() of Queue
To implement double ended queue, run the main() of DQueue
To implement a binary search tree, run the main() of BST
To implement binary search on a linked list sorted in ascending order, run the main() of BinSearch
-
Stack functions:
Push
Pop
Display
Display Size
-
Queue functions:
Insert
Delete
Display
Display Size
-
BST functions:
Insert
Display (inorder traversal)
-
Binary Search functions:
Insert
Search (determine if element is present in list or not)
Display
-
DQueue functions:
Insert Front
Insert Back
Remove Front
Remove Back
Display (normal)
Display (reverse)
Display Size