Skip to content
/ data-structures Public

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.

0 stars 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

arjunsawhney1/data-structures

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
Custom Data Structures
Custom Data Structures
 
 
Doubly Linked List
Doubly Linked List
 
 
Hash Tables
Hash Tables
 
 
Trees
Trees
 
 
dHeap
dHeap
 
 
README.md
README.md
 
 

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

bloom-filter priority-queue data-structures binary-search-tree heap hashtable trees round-robin-scheduler huffman-compression-algorithm huffman-encoder huffman-compression

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages