Format codes

Author: heqin-zhu

README.md

@@ -6,7 +6,7 @@
 [![repo-size](https://img.shields.io/github/repo-size/mbinary/algorithm.svg)]()
 [![License](https://img.shields.io/badge/LICENSE-WTFPL-blue.svg)](LICENSE)
 [![Language](https://img.shields.io/badge/language-python3-orange.svg)]()
-[![codebeat badge](https://codebeat.co/badges/d52dd17d-a437-4dee-a6ec-cb532e8135bd)](https://codebeat.co/projects/github-com-mbinary-algorithm-master)
+[![codebeat badge](https://codebeat.co/badges/4ef725b5-405a-4390-a860-a86deefab3f8)](https://codebeat.co/projects/github-com-mbinary-algorithm-master)
 
 >Notes and codes for learning algorithm and data structures :smiley:
 
@@ -17,12 +17,10 @@ Some pictures and ideas are from `<<Introduction to Algotithm>>`
 * [.](.)
     * [LICENSE](./LICENSE)
     * [README.md](./README.md)
-    * [backtracking](./backtracking)
     * [dataStructure](./dataStructure)
         * [LRU](./dataStructure/LRU)
         * [bTree.py](./dataStructure/bTree.py)
         * [binaryHeap.py](./dataStructure/binaryHeap.py)
-        * [binaryHeap1.py](./dataStructure/binaryHeap1.py)
         * [binaryTree.py](./dataStructure/binaryTree.py)
         * [circularQueue.py](./dataStructure/circularQueue.py)
         * [graph](./dataStructure/graph)
@@ -32,15 +30,14 @@ Some pictures and ideas are from `<<Introduction to Algotithm>>`
         * [intervalTree.py](./dataStructure/intervalTree.py)
         * [leftHeap.py](./dataStructure/leftHeap.py)
         * [linkedList.py](./dataStructure/linkedList.py)
-        * [loserTree.py](./dataStructure/loserTree.py)
         * [map.cc](./dataStructure/map.cc)
         * [polynomial.cpp](./dataStructure/polynomial.cpp)
         * [polynomial.py](./dataStructure/polynomial.py)
         * [redBlackTree.py](./dataStructure/redBlackTree.py)
         * [redBlackTree0.py](./dataStructure/redBlackTree0.py)
         * [splayTree.py](./dataStructure/splayTree.py)
         * [trie](./dataStructure/trie)
-        * [unionFindSet](./dataStructure/unionFindSet)
+        * [unionFindSet.py](./dataStructure/unionFindSet.py)
         * [winnerTree.py](./dataStructure/winnerTree.py)
     * [divideAndConquer](./divideAndConquer)
         * [min_distance_of_n_points.py](./divideAndConquer/min_distance_of_n_points.py)
@@ -85,8 +82,9 @@ Some pictures and ideas are from `<<Introduction to Algotithm>>`
         * [PL0-compiler](./parser/PL0-compiler)
         * [calculator](./parser/calculator)
         * [declarationParser](./parser/declarationParser)
+    * [poly.c](./poly.c)
     * [search](./search)
-        * [8Astar.py](./search/8Astar.py)
+        * [Astar.py](./search/Astar.py)
         * [BFS_knight.hs](./search/BFS_knight.hs)
         * [binary_search.hs](./search/binary_search.hs)
         * [bloomFilter.py](./search/bloomFilter.py)