* Update copyright
* Update the Python code
* Fix the code comments in ArrayBinaryTree
* Fix the code comments in ArrayBinaryTree
* Roll back time_comlexity.py
* Add the visualizing code(pythontutor) blocks to the chapter complexity, data structure, array and linked list, stack and queue, hash table, and backtracking
* Fix the code comments
* Sync recent changes to the revised Word.
* Revised the preface chapter
* Revised the introduction chapter
* Revised the computation complexity chapter
* Revised the chapter data structure
* Revised the chapter array and linked list
* Revised the chapter stack and queue
* Revised the chapter hashing
* Revised the chapter tree
* Revised the chapter heap
* Revised the chapter graph
* Revised the chapter searching
* Reivised the sorting chapter
* Revised the divide and conquer chapter
* Revised the chapter backtacking
* Revised the DP chapter
* Revised the greedy chapter
* Revised the appendix chapter
* Revised the preface chapter doubly
* Revised the figures
* Update Dockerfile for code debugging.
* Format Python code using Black.
* Improve dark theme by defining html classes for the figures, animations and cover images.
* Fix several glossary translation.
* Update a code comment.
* Fix climbing_stairs_backtrack: the pruning should not require the sorted choices list.
* Update the code of array and list traversal.
* Fix a rendering issue of README.md
* Update code of list traversal.
* Fix array_definition.png
* Update README.md
* Fix max_capacity_moving_short_board.png
* Fix array.dart
* Fix array.dart
* Fix array.dart
* Fix array.dart
* Modify method name to PascalCase(array and linked list)
* Modify method name to PascalCase(backtracking)
* Modify method name to PascalCase(computational complexity)
* Modify method name to PascalCase(divide and conquer)
* Modify method name to PascalCase(dynamic programming)
* Modify method name to PascalCase(graph)
* Modify method name to PascalCase(greedy)
* Modify method name to PascalCase(hashing)
* Modify method name to PascalCase(heap)
* Modify method name to PascalCase(searching)
* Modify method name to PascalCase(sorting)
* Modify method name to PascalCase(stack and queue)
* Modify method name to PascalCase(tree)
* local check
