Reformat the C# codes.

Disable creating new line before open brace.

codes/csharp/chapter_tree/binary_search_tree.cs

@@ -9,25 +9,21 @@ using NUnit.Framework;
 
 namespace hello_algo.chapter_tree;
 
-class BinarySearchTree
-{
+class BinarySearchTree {
     TreeNode? root;
 
-    public BinarySearchTree(int[] nums)
-    {
+    public BinarySearchTree(int[] nums) {
         Array.Sort(nums); // 排序数组
         root = buildTree(nums, 0, nums.Length - 1);  // 构建二叉搜索树
     }
 
     /* 获取二叉树根节点 */
-    public TreeNode? getRoot()
-    {
+    public TreeNode? getRoot() {
         return root;
     }
 
     /* 构建二叉搜索树 */
-    public TreeNode? buildTree(int[] nums, int i, int j)
-    {
+    public TreeNode? buildTree(int[] nums, int i, int j) {
         if (i > j) return null;
         // 将数组中间节点作为根节点
         int mid = (i + j) / 2;
@@ -39,12 +35,10 @@ class BinarySearchTree
     }
 
     /* 查找节点 */
-    public TreeNode? search(int num)
-    {
+    public TreeNode? search(int num) {
         TreeNode? cur = root;
         // 循环查找，越过叶节点后跳出
-        while (cur != null)
-        {
+        while (cur != null) {
             // 目标节点在 cur 的右子树中
             if (cur.val < num) cur = cur.right;
             // 目标节点在 cur 的左子树中
@@ -57,14 +51,12 @@ class BinarySearchTree
     }
 
     /* 插入节点 */
-    public void insert(int num)
-    {
+    public void insert(int num) {
         // 若树为空，直接提前返回
         if (root == null) return;
         TreeNode? cur = root, pre = null;
         // 循环查找，越过叶节点后跳出
-        while (cur != null)
-        {
+        while (cur != null) {
             // 找到重复节点，直接返回
             if (cur.val == num) return;
             pre = cur;
@@ -76,8 +68,7 @@ class BinarySearchTree
 
         // 插入节点 val
         TreeNode node = new TreeNode(num);
-        if (pre != null)
-        {
+        if (pre != null) {
             if (pre.val < num) pre.right = node;
             else pre.left = node;
         }
@@ -85,14 +76,12 @@ class BinarySearchTree
 
 
     /* 删除节点 */
-    public void remove(int num)
-    {
+    public void remove(int num) {
         // 若树为空，直接提前返回
         if (root == null) return;
         TreeNode? cur = root, pre = null;
         // 循环查找，越过叶节点后跳出
-        while (cur != null)
-        {
+        while (cur != null) {
             // 找到待删除节点，跳出循环
             if (cur.val == num) break;
             pre = cur;
@@ -104,27 +93,21 @@ class BinarySearchTree
         // 若无待删除节点，则直接返回
         if (cur == null || pre == null) return;
         // 子节点数量 = 0 or 1
-        if (cur.left == null || cur.right == null)
-        {
+        if (cur.left == null || cur.right == null) {
             // 当子节点数量 = 0 / 1 时， child = null / 该子节点
             TreeNode? child = cur.left != null ? cur.left : cur.right;
             // 删除节点 cur
-            if (pre.left == cur)
-            {
+            if (pre.left == cur) {
                 pre.left = child;
-            }
-            else
-            {
+            } else {
                 pre.right = child;
             }
         }
         // 子节点数量 = 2
-        else
-        {
+        else {
             // 获取中序遍历中 cur 的下一个节点
             TreeNode? tmp = cur.right;
-            while (tmp.left != null)
-            {
+            while (tmp.left != null) {
                 tmp = tmp.left;
             }
             // 递归删除节点 tmp
@@ -135,11 +118,9 @@ class BinarySearchTree
     }
 }
 
-public class binary_search_tree
-{
+public class binary_search_tree {
     [Test]
-    public void Test()
-    {
+    public void Test() {
         /* 初始化二叉搜索树 */
         int[] nums = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 };
         BinarySearchTree bst = new BinarySearchTree(nums);