This repository records some commonly used data structures and sorting algorithms written in Java.
If you find any bug in any one of the data sctructure, please let me know! :octocat:
Dynamically changing the array length(insert method) by creating new array.
Simple binary search tree, no duplicate keys allowed.
Implemented using Linear Probing.
Assumption: The input will be lowercases
Max Heap
Singly LinkedList using recursion.
A basic implementation of array based circular queue.
This includes simple sorting : Bubble Sort, Selection Sort, Insertion Sort. In addition, it also contains advanced sorting: merge sort, and quick sort.
An array based stack implementation.