Skip to content
This repository has been archived by the owner on Oct 20, 2022. It is now read-only.

Data-Structures implementations from scratch using java 8.0

Notifications You must be signed in to change notification settings

harsh-apcr/Data-Structures-Java

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

23 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Data-Structures library for java 8.0 or above

This repository contains usefull fast ready-to-use implementations of generic data structures in java, implementable in 8.0 or above.

List of data-structures that are implemented -

  • Doubly Linked List
    • A simple doubly linked list implemenation based on header and trailer sentinel nodes
  • Stack
    • A growable array implementation of Stack
  • Queue
    • (Interface for standard queue) MyQueue
    • (Interface for double ended queue) MyDeque
    • (Array implementation of MyDeque)MyArrayDequeu
    • (List implementation of Queue) ListDeque
  • Tree
    • BinaryTree (A generic binary tree data-structure)
    • BinarySearchTree (A comparator must be provided)
    • Red-Black-Tree (extends BinarySearchTree)

Look at the standard documentation in the files for more information on how to use these Data-Structures