Skip to content

In this repo, I build and unit test several classic and custom Data Structures from scratch. I also build implementations of these data structures in the form of Bloom Filters, Round Robin Schedulers, etc.

Notifications You must be signed in to change notification settings

arjunsawhney1/data-structures

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Introduction

In this repo, I build and unit test several classic and custom Data Structures from scratch.

Classic Data Structures

  • Doubly Linked List
  • Hash Table
  • Binary Search Tree
  • d-Heap

Custom Data Structures

  • DAFTree: Modified generic Binary Search Tree that supports storing duplicates
  • FADAF (Fast Access DAF): allows fast add, remove, lookup using a DAFTree and HashTable

Implementations

  • DLLQueue
  • DLLStack
  • DLL Round Robin Scheduler
  • BloomFilter
  • Huffman Compression Tree
  • Priority Queue

About

In this repo, I build and unit test several classic and custom Data Structures from scratch. I also build implementations of these data structures in the form of Bloom Filters, Round Robin Schedulers, etc.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages