This repository contains the python implementation of algorithms and data structures used in programming.

Feel free to contribute and add more implementations.

• Naive Graph

• [Heap] (https://github.com/isubuz/zahlen/blob/master/ds/heap/heap.py)
• [Median Heap] (https://github.com/isubuz/zahlen/blob/master/ds/heap/median_heap.py)
• [Min-max Heap] (https://github.com/isubuz/zahlen/blob/master/ds/heap/min_max_heap.py)
• [Min-max-median Heap] (https://github.com/isubuz/zahlen/blob/master/ds/heap/min_max_median_heap.py)

• [AVL Tree] (https://github.com/isubuz/zahlen/blob/master/ds/tree/avl_tree.py)
• [Binary Search Tree] (https://github.com/isubuz/zahlen/blob/master/ds/tree/binary_search_tree.py)
• [Binary Search Tree with duplicate keys] (https://github.com/isubuz/zahlen/blob/master/ds/tree/binary_search_tree_with_dup.py)
• [Bit Indexed Tree (Fenwick Tree)] (https://github.com/isubuz/zahlen/blob/master/ds/tree/fenwick_tree.py)
• [Order Statistics Tree] (https://github.com/isubuz/zahlen/blob/master/ds/tree/order_statistics_tree.py)
• [Segment Tree] (https://github.com/isubuz/zahlen/blob/master/ds/tree/segment_tree.py)
• Suffix Tree

• Trie
• Patricia Trie

• Text Justification

• Depth first search
• Breadth first search

• Counting sort
• [Heap sort] (https://github.com/isubuz/zahlen/blob/master/ds/heap/heap.py)
• Insertion sort
• Quick sort
• Radix sort

• Rabin Karp