feat: Add visualizing code blocks based on the pythontutor (#1029)

* 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

codes/java/chapter_array_and_linkedlist/my_list.java

@@ -76,7 +76,7 @@ class MyList {
         if (index < 0 || index >= size)
             throw new IndexOutOfBoundsException("索引越界");
         int num = arr[index];
-        // 将索引 index 之后的元素都向前移动一位
+        // 将将索引 index 之后的元素都向前移动一位
         for (int j = index; j < size - 1; j++) {
             arr[j] = arr[j + 1];
         }

codes/java/chapter_tree/array_binary_tree.java

@@ -18,7 +18,7 @@ class ArrayBinaryTree {
         tree = new ArrayList<>(arr);
     }
 
-    /* 节点数量 */
+    /* 列表容量 */
     public int size() {
         return tree.size();
     }