Data Structure Implementations in Java

We know how data structure plays an important role in interview preparation as well for problem solving.

Usually we use internal data structures and we don’t know how things are working behind. Using a data structure without knowing its working its useless. This data structure implementation are asked in interview and if you know how to implement a data structure you can design your own custom data structure according to your needs.

So you understood that data structure implementation will not only help you in interview but also can be used in development for creating custom structures. So from where we need to learn this?

I have made this GitHub repository containing all the internal collection framework of Java plus Data structures needed in daily life. Below is the list of Data structures in my GitHub repo

S.NO	Data Structure		Prerequisite
1	Lists	S.NO Data Structure 1.1 ArrayList 1.2 SingleLinkedList 1.3 DoubleLinkedList 1.4 CircularLinkedList 1.5 Stack	Arrays, Object oriented concepts
2	Queues	S.NO Data Structure 2.1 Queue 2.2 Deque 2.3 Circular Queue	Arrays
3	Trees	S.NO Data Structure 3.1 BinaryTree 3.2 BinarySearchTree 3.3 N_Arry Tree 3.4 AVL Tree 3.5 Complete Binary Tree	BTree
4	Maps	S.NO Data Structure 4.1 HashMap 4.2 LinkedHashMap 4.3 TreeMap	Hash Collision , Hashing
5	Sets	S.NO Data Structure 5.1 HashSet 5.2 LinkedHashSet 5.3 TreeSet	Maps
6	Heap / Priority-Queue	S.NO Data Structure 6.1 Heap 6.2 Heap Heapify	Trees
7	Trie / Prefix-Tree	S.NO Data Structure 7.1 Trie	Trees
8	Graphs	S.NO Data Structure 8.1 Graph 8.2 GenericGraph 8.3 GenericGraphExample	Trees traversals