# Algorithm and Data Structures >Notes and codes for learning algorithm and data structures :smiley: Some pictures and idead are from `<> I use python 3.6+ and c++ to implements them. Since I used f-Strings in python, you may use python 3.6+ to run the following python scripts. >>I am still learning new things and this repo is always updating. # Notice Currently, Github can't render latex math formulas. So,if you wannt to view the notes which contain latex math formulas and are in markdown format, you can visit [my blog](https://mbinary.coding.me) # Index * [.](.) * [notes](./notes) * [alg-general.md](./notes/alg-general.md) * [hashTable.md](./notes/hashTable.md) * [red-black-tree.md](./notes/red-black-tree.md) * [sort.md](./notes/sort.md) * [tree.md](./notes/tree.md) * [b-tree.md](./notes/b-tree.md) * [graph](./notes/graph.md) * [fibonacci-heap](./notes/fib-heap.md) * [algorithm](./algorithm) * [8Astar.py](./algorithm/8Astar.py) * [cantor.cc](./algorithm/cantor.cc) * [manacher.py](./algorithm/manacher.py) * [markov.py](./algorithm/markov.py) * [sort](./algorithm/sort) * [sunday.py](./algorithm/sunday.py) * [dataStructure](./dataStructure) * [redBlackTree.py](./dataStructure/redBlackTree.py) * [bTree.py](./dataStructure/bTree.py) * [hashTable.py](./dataStructure/hashTable.py) * [splayTree.py](./dataStructure/splayTree.py) * [allOone](./dataStructure/allOone) * [binaryHeap.py](./dataStructure/binaryHeap.py) * [binaryTree.py](./dataStructure/binaryTree.py) * [graph](./dataStructure/graph) * [huffman](./dataStructure/huffman) * [leftHeap.py](./dataStructure/leftHeap.py) * [loserTree.py](./dataStructure/loserTree.py) * [map.cc](./dataStructure/map.cc) * [polynomial.cpp](./dataStructure/polynomial.cpp) * [polynomial.py](./dataStructure/polynomial.py) * [trie.py](./dataStructure/trie.py) * [winnerTree.py](./dataStructure/winnerTree.py)