Implemented data structures in this repository:
- Fenwick Tree
- Segment Tree
- Suffix Tree
- Trie
- Ternary Search Tree
- B-tree
- Cartesian Tree
- Difference Array
- Interval Tree
- KD Tree
- Sparse Set
- Graph
- Binary Heap
- Binomial Heap
- Singly Linked List
- Doubly Linked List
- Circular Linked List
- Queue
- Stack
- Binary Tree
- Binary Search Tree
- AVL Tree
- Red Black Tree
- Splay Tree
- Treap
- Union Find
Most of the data-structures have existing test-cases to explore various functionality and time/space complexity mentioned in the method comments.
If you want to contribute read CONTRIBUTING.md