These implementations are for learning purposes only. Therefore they may be less efficient than the implementations in the standard library.
binary_tree
├── cpp
└── python
disjoint_set
├── cpp
└── python
hashing
├── cpp
└── python
└── number_theory
heap
├── cpp
└── python
linked_list
├── cpp
└── python
queue
├── cpp
└── python
stacks
├── cpp
└── python
trie
├── cpp
└── python
Contains the implementation of some data structures related to Binary tree.
| Topic/Question | Code in Python | Code in C++ |
|---|---|---|
| Implementation of an auto-balanced binary tree | py | cpp |
| Basic binary tree | py | cpp |
| Binary search tree recursive | py | - |
| Binary search tree | py | cpp |
| Binary tree mirror | py | - |
| Binary tree traversals | py | - |
| Fenwick tree | py | - |
| Lazy segment tree | py | - |
| Lowest common ancestor | py | - |
| Non recursive segment tree | py | - |
| Number of possible binary trees | py | - |
| Red black tree | py | cpp |
| Segment tree other | py | - |
| Segremt tree | py | - |
| Treap | py | - |
Contains the implementation of some data structures related to Disjoint Set.
| Topic/Question | Code in Python | Code in C++ |
|---|---|---|
| Alternate disjoint set | py | - |
| Disjoint Set | py | cpp |
Contains the implementation of some data structures related to Hashing.
| Topic/Question | Code in Python | Code in C++ |
|---|---|---|
| Double hash | py | - |
| Hash table with linked list | py | - |
| Hash table | py | - |
| Quadratic probling | py | - |
| Prime numbers (Number theory) | py | - |
Contains the implementation of some data structures related to Heap.
| Topic/Question | Code in Python | Code in C++ |
|---|---|---|
| Binominal heap | py | - |
| Heap generic | py | - |
| Heap | py | cpp |
| Max heap | py | - |
| Min heap | py | - |
| Randomized heap | py | - |
| Skew heap | py | - |
Contains the implementation of some data structures related to Linked list.
| Topic/Question | Code in Python | Code in C++ |
|---|---|---|
| Circular linked list | py | - |
| Deque doubly linked list | py | - |
| Doubly linked list two | py | - |
| Doubly linked list | py | cpp |
| From sequence | py | - |
| Has loop | py | - |
| Is palindrome linked list | py | - |
| Middle element of linked list | py | - |
| Print reverse linked list | py | cpp |
| Singly linked list | py | cpp |
| Skip list | py | cpp |
| Swap nodes | py | - |
Contains the implementation of some data structures related to Queue.
| Topic/Question | Code in Python | Code in C++ |
|---|---|---|
| Circular queue | py | cpp |
| Double ended queue | py | - |
| Linked queue | py | cpp |
| Priority queue using list | py | cpp |
| Queue on list | py | cpp |
| Queue on pseudo stack | py | - |
Contains the implementation of some data structures related to Stacks.
| Topic/Question | Code in Python | Code in C++ |
|---|---|---|
| Balanced Parentheses | py | - |
| Dijkstras two stack algorithm | py | - |
| Evaluate postfix notations | py | - |
| Infix to postfix conversion | py | - |
| Infix to prefix conversion | py | - |
| Linked stack | py | cpp |
| Next greater element | py | - |
| Postfix evaluation | py | - |
| Prefix evaluation | py | - |
| Stack using dll | py | cpp |
| Stack | py | - |
| stock span problem | py | - |
Contains the implementation of some data structures related to Trie.
| Topic/Question | Code in Python | Code in C++ |
|---|---|---|
| Implementation of Trie data structure | py | - |