1.Please remove all the unused libs for every files

2.add a file header for all the files

codes/csharp/chapter_array_and_linkedlist/list.cs

@@ -1,11 +1,10 @@
-using Newtonsoft.Json.Linq;
+/**
+ * File: list.cs
+ * Created Time: 2022-12-23
+ * Author: haptear ([email protected])
+ */
+
 using NUnit.Framework;
-using System;
-using System.Collections.Generic;
-using System.Linq;
-using System.Text;
-using System.Threading.Tasks;
-using System.Xml.Linq;
 
 namespace hello_algo.chapter_array_and_linkedlist
 {

codes/csharp/chapter_array_and_linkedlist/my_list.cs

@@ -1,10 +1,10 @@
-using Newtonsoft.Json.Linq;
+/**
+ * File: my_list.cs
+ * Created Time: 2022-12-23
+ * Author: haptear ([email protected])
+ */
+
 using NUnit.Framework;
-using System;
-using System.Collections.Generic;
-using System.Linq;
-using System.Text;
-using System.Threading.Tasks;
 
 namespace hello_algo.chapter_array_and_linkedlist
 {

codes/csharp/chapter_computational_complexity/leetcode_two_sum.cs

@@ -1,9 +1,10 @@
-using NUnit.Framework;
-using System;
-using System.Collections.Generic;
-using System.Linq;
-using System.Text;
-using System.Threading.Tasks;
+/**
+ * File: leetcode_two_sum.cs
+ * Created Time: 2022-12-23
+ * Author: haptear ([email protected])
+ */
+
+using NUnit.Framework;
 
 namespace hello_algo.chapter_computational_complexity
 {

codes/csharp/chapter_computational_complexity/space_complexity.cs

@@ -1,10 +1,11 @@
-using hello_algo.include;
+/**
+ * File: space_complexity.cs
+ * Created Time: 2022-12-23
+ * Author: haptear ([email protected])
+ */
+
+using hello_algo.include;
 using NUnit.Framework;
-using System;
-using System.Collections.Generic;
-using System.Linq;
-using System.Text;
-using System.Threading.Tasks;
 
 namespace hello_algo.chapter_computational_complexity
 {

codes/csharp/chapter_computational_complexity/time_complexity.cs

@@ -1,4 +1,10 @@
-using NUnit.Framework;
+/**
+ * File: time_complexity.cs
+ * Created Time: 2022-12-23
+ * Author: haptear ([email protected])
+ */
+
+using NUnit.Framework;
 
 namespace hello_algo.chapter_computational_complexity
 {

codes/csharp/chapter_computational_complexity/worst_best_time_complexity.cs

@@ -1,8 +1,8 @@
-using System;
-using System.Collections.Generic;
-using System.Linq;
-using System.Text;
-using System.Threading.Tasks;
+/**
+ * File: worst_best_time_complexity.cs
+ * Created Time: 2022-12-23
+ * Author: haptear ([email protected])
+ */
 
 namespace hello_algo.chapter_computational_complexity
 {

codes/csharp/chapter_hashing/array_hash_map.cs

@@ -1,7 +1,10 @@
+/**
+ * File: array_hash_map.cs
+ * Created Time: 2022-12-23
+ * Author: haptear ([email protected])
+ */
 
-using hello_algo.include;
 using NUnit.Framework;
-using System.Collections.Immutable;
 
 namespace hello_algo.chapter_hashing
 {

codes/csharp/chapter_hashing/hash_map.cs

@@ -1,7 +1,12 @@
 
+/**
+ * File: hash_map.cs
+ * Created Time: 2022-12-23
+ * Author: haptear ([email protected])
+ */
+
 using hello_algo.include;
 using NUnit.Framework;
-using System.Collections.Immutable;
 
 namespace hello_algo.chapter_hashing
 {

codes/csharp/chapter_searching/binary_search.cs

@@ -1,9 +1,10 @@
-using NUnit.Framework;
-using System;
-using System.Collections.Generic;
-using System.Linq;
-using System.Text;
-using System.Threading.Tasks;
+/**
+ * File: binary_search.cs
+ * Created Time: 2022-12-23
+ * Author: haptear ([email protected])
+ */
+
+using NUnit.Framework;
 
 namespace hello_algo.chapter_searching
 {

codes/csharp/chapter_searching/hashing_search.cs

@@ -1,11 +1,11 @@
-using hello_algo.include;
+/**
+ * File: hashing_search.cs
+ * Created Time: 2022-12-23
+ * Author: haptear ([email protected])
+ */
+
+using hello_algo.include;
 using NUnit.Framework;
-using System;
-using System.Collections;
-using System.Collections.Generic;
-using System.Linq;
-using System.Text;
-using System.Threading.Tasks;
 
 namespace hello_algo.chapter_searching
 {

codes/csharp/chapter_searching/linear_search.cs

@@ -1,10 +1,11 @@
-using hello_algo.include;
+/**
+ * File: linear_search.cs
+ * Created Time: 2022-12-23
+ * Author: haptear ([email protected])
+ */
+
+using hello_algo.include;
 using NUnit.Framework;
-using System;
-using System.Collections.Generic;
-using System.Linq;
-using System.Text;
-using System.Threading.Tasks;
 
 namespace hello_algo.chapter_searching
 {

codes/csharp/chapter_sorting/bubble_sort.cs

@@ -1,9 +1,10 @@
-using NUnit.Framework;
-using System;
-using System.Collections.Generic;
-using System.Linq;
-using System.Text;
-using System.Threading.Tasks;
+/**
+ * File: bubble_sort.cs
+ * Created Time: 2022-12-23
+ * Author: haptear ([email protected])
+ */
+
+using NUnit.Framework;
 
 namespace hello_algo.chapter_sorting
 {

codes/csharp/chapter_sorting/insertion_sort.cs

@@ -1,4 +1,10 @@
-using NUnit.Framework;
+/**
+ * File: insertion_sort.cs
+ * Created Time: 2022-12-23
+ * Author: haptear ([email protected])
+ */
+
+using NUnit.Framework;
 
 namespace hello_algo.chapter_sorting
 {

codes/csharp/chapter_sorting/merge_sort.cs

@@ -1,9 +1,10 @@
-using NUnit.Framework;
-using System;
-using System.Collections.Generic;
-using System.Linq;
-using System.Text;
-using System.Threading.Tasks;
+/**
+ * File: merge_sort.cs
+ * Created Time: 2022-12-23
+ * Author: haptear ([email protected])
+ */
+
+using NUnit.Framework;
 
 namespace hello_algo.chapter_sorting
 {

codes/csharp/chapter_sorting/quick_sort.cs

@@ -1,9 +1,10 @@
-using NUnit.Framework;
-using System;
-using System.Collections.Generic;
-using System.Linq;
-using System.Text;
-using System.Threading.Tasks;
+/**
+ * File: quick_sort.cs
+ * Created Time: 2022-12-23
+ * Author: haptear ([email protected])
+ */
+
+using NUnit.Framework;
 
 namespace hello_algo.chapter_sorting
 {

codes/csharp/chapter_stack_and_queue/array_queue.cs

@@ -1,5 +1,9 @@
-using System;
-using hello_algo.include;
+/**
+ * File: array_queue.cs
+ * Created Time: 2022-12-23
+ * Author: haptear ([email protected])
+ */
+
 using NUnit.Framework;
 
 namespace hello_algo.chapter_stack_and_queue

codes/csharp/chapter_stack_and_queue/array_stack.cs

@@ -1,5 +1,9 @@
-using System;
-using hello_algo.include;
+/**
+ * File: array_stack.cs
+ * Created Time: 2022-12-23
+ * Author: haptear ([email protected])
+ */
+
 using NUnit.Framework;
 
 namespace hello_algo.chapter_stack_and_queue

codes/csharp/chapter_stack_and_queue/linkedlist_queue.cs

@@ -1,4 +1,9 @@
-using System;
+/**
+ * File: linkedlist_queue.cs
+ * Created Time: 2022-12-23
+ * Author: haptear ([email protected])
+ */
+
 using hello_algo.include;
 using NUnit.Framework;
 

codes/csharp/chapter_stack_and_queue/linkedlist_stack.cs

@@ -1,4 +1,9 @@
-using System;
+/**
+ * File: linkedlist_stack.cs
+ * Created Time: 2022-12-23
+ * Author: haptear ([email protected])
+ */
+
 using hello_algo.include;
 using NUnit.Framework;
 

codes/csharp/chapter_stack_and_queue/queue.cs

@@ -1,5 +1,9 @@
-using System;
-using hello_algo.include;
+/**
+ * File: queue.cs
+ * Created Time: 2022-12-23
+ * Author: haptear ([email protected])
+ */
+
 using NUnit.Framework;
 
 namespace hello_algo.chapter_stack_and_queue

codes/csharp/chapter_stack_and_queue/stack.cs

@@ -1,6 +1,10 @@
+/**
+ * File: stack.cs
+ * Created Time: 2022-12-23
+ * Author: haptear ([email protected])
+ */
 
 using NUnit.Framework;
-using System.Collections.Immutable;
 
 namespace hello_algo.chapter_stack_and_queue
 {
@@ -18,15 +22,15 @@ public void Test()
             stack.Push(2);
             stack.Push(5);
             stack.Push(4);
-            Console.WriteLine("栈 stack = " + String.Join(",", stack.ToImmutableArray()));
+            Console.WriteLine("栈 stack = " + string.Join(",", stack.ToArray()));
 
             /* 访问栈顶元素 */
             int peek = stack.Peek();
             Console.WriteLine("栈顶元素 peek = " + peek);
 
             /* 元素出栈 */
             int pop = stack.Pop();
-            Console.WriteLine("出栈元素 pop = " + pop + "，出栈后 stack = " + String.Join(",", stack.ToImmutableArray()));
+            Console.WriteLine("出栈元素 pop = " + pop + "，出栈后 stack = " + string.Join(",", stack.ToArray()));
 
             /* 获取栈的长度 */
             int size = stack.Count();

codes/csharp/chapter_tree/avl_tree.cs

@@ -1,6 +1,11 @@
-using hello_algo.include;
+/**
+ * File: avl_tree.cs
+ * Created Time: 2022-12-23
+ * Author: haptear ([email protected])
+ */
+
+using hello_algo.include;
 using NUnit.Framework;
-using System.Collections.Generic;
 
 namespace hello_algo.chapter_tree
 {
@@ -69,7 +74,7 @@ public int balanceFactor(TreeNode? node)
         }
 
         /* 执行旋转操作，使该子树重新恢复平衡 */
-        private TreeNode? rotate(TreeNode? node)
+        TreeNode? rotate(TreeNode? node)
         {
             if (node == null)
                 return node;

codes/csharp/chapter_tree/binary_search_tree.cs

@@ -1,7 +1,11 @@
-using hello_algo.include;
-using NUnit.Framework;
-using System.Collections.Generic;
+/**
+ * File: binary_search_tree.cs
+ * Created Time: 2022-12-23
+ * Author: haptear ([email protected])
+ */
 
+using hello_algo.include;
+using NUnit.Framework;
 
 namespace hello_algo.chapter_tree
 {
@@ -31,11 +35,7 @@ internal class binary_search_tree
             return cur;
         }
 
-        /// <summary>
-        /// 插入结点
-        /// </summary>
-        /// <param name="num"></param>
-        /// <returns></returns>
+        /* 插入结点 */
         TreeNode? insert(int num)
         {
             // 若树为空，直接提前返回

codes/csharp/chapter_tree/binary_tree.cs

@@ -1,7 +1,11 @@
+/**
+ * File: binary_tree.cs
+ * Created Time: 2022-12-23
+ * Author: haptear ([email protected])
+ */
+
 using hello_algo.include;
 using NUnit.Framework;
-using System.Collections.Generic;
-
 
 namespace hello_algo.chapter_tree
 {