Data Structures

This page provides an extensive index of all the data structure implementation found in Structures repo, to best of our knowledge and effort. In case, if you find something missing or misleading, let us know.

These data structure are abstract in nature, you can use them as collection in any of your creative problem, like we did in ours. To know more how to use them, checkout some of our examples in Creative Problems section.

Arrays

Linked Lists

Stacks

• A generic implementation of resizable Stack - #Stack
• A stack implementation using Linked List - #StackOfStrings
• A stack with a fixed capacity using arrays - #FixedCapacityStackOfStrings
• A stack with resizable capacity using arrays - #ResizableStackOfStrings
• A stack with find() and delete() operation on middle elements - #StackWithMiddle
• A Stack with peek() operation that returns the last item without removing it - [#StackWithPeek] (https://github.com/ashish-chopra/Structures/blob/master/src/main/java/com/stacks/Stack.java)

Queues

• A generic implementation of resizable Queue- #Queue
• A queue implementation using Linked List - #QueueOfStrings
• A queue with a fixed capacity using arrays - #FixedCapacityQueueOfStrings
• A queue with resizable capacity using arrays - #ResizableQueueOfStrings
• A generic double-ended queue Deque implementation - #Deque
• A generic randomized queue that returns any random entry - #RandomizedQueue
• A generic Stack-ended queue Steque - #Steque

Bags

• An iterable Bag implementation - #Bag

Union-Find

• A Union-Find implementation for Dynamic Connectivity problem - #UnionFind
• Quick Union-Find implementation with optimized union() operation - #QuickUF
• A weighted Quick Union-Find implementation to optimize union() and find() operation - #WeightedQuickUF

Symbol Tables

• A generic Symbol Table implementation for ordered data using binary search for searching operation - #ST
• A generic Symbol Table for unordered data using oblivious search for searching operation - #UnorderedST

Trees

• A generic Binary Search Tree implementation with ordered operation APIs - #BST

Graphs