Format the C code in Clang-Format Style: Microsoft

codes/c/chapter_tree/binary_search_tree.c

@@ -15,7 +15,7 @@ typedef struct binarySearchTree binarySearchTree;
 
 int sortIntHelper(const void *a, const void *b) {
     // 从小到大排序
-    return (*(int *) a - *(int *) b);
+    return (*(int *)a - *(int *)b);
 }
 
 /* 构建二叉搜索树 */
@@ -33,7 +33,7 @@ TreeNode *buildTree(int nums[], int i, int j) {
 }
 
 binarySearchTree *newBinarySearchTree(int nums[], int size) {
-    binarySearchTree *bst = (binarySearchTree *) malloc(sizeof(binarySearchTree));
+    binarySearchTree *bst = (binarySearchTree *)malloc(sizeof(binarySearchTree));
     TreeNode *root;
     // 从小到大排序数组
     qsort(nums, size, sizeof(int), sortIntHelper);
@@ -108,7 +108,8 @@ void removeNode(binarySearchTree *bst, int num) {
     // 循环查找，越过叶节点后跳出
     while (cur != NULL) {
         // 找到待删除节点，跳出循环
-        if (cur->val == num) break;
+        if (cur->val == num)
+            break;
         pre = cur;
         if (cur->val < num) {
             // 待删除节点在 root 的右子树中
@@ -159,13 +160,11 @@ int main() {
     TreeNode *node = search(bst, 7);
     printf("查找到的节点对象的节点值 = %d\n", node->val);
 
-
     /* 插入节点 */
     insert(bst, 16);
     printf("插入节点 16 后，二叉树为\n");
     printTree(getRoot(bst));
 
-
     /* 删除节点 */
     removeNode(bst, 1);
     printf("删除节点 1 后，二叉树为\n");

codes/c/chapter_tree/binary_tree.c

@@ -10,11 +10,11 @@
 int main() {
     /* 初始化二叉树 */
     // 初始化节点
-    TreeNode* n1 = newTreeNode(1);
-    TreeNode* n2 = newTreeNode(2);
-    TreeNode* n3 = newTreeNode(3);
-    TreeNode* n4 = newTreeNode(4);
-    TreeNode* n5 = newTreeNode(5);
+    TreeNode *n1 = newTreeNode(1);
+    TreeNode *n2 = newTreeNode(2);
+    TreeNode *n3 = newTreeNode(3);
+    TreeNode *n4 = newTreeNode(4);
+    TreeNode *n5 = newTreeNode(5);
     // 构建引用指向（即指针）
     n1->left = n2;
     n1->right = n3;
@@ -24,7 +24,7 @@ int main() {
     printTree(n1);
 
     /* 插入与删除节点 */
-    TreeNode* P = newTreeNode(0);
+    TreeNode *P = newTreeNode(0);
     // 在 n1 -> n2 中间插入节点 P
     n1->left = P;
     P->left = n2;

codes/c/chapter_tree/binary_tree_bfs.c

@@ -15,14 +15,14 @@ int *levelOrder(TreeNode *root, int *size) {
     TreeNode **queue;
 
     /* 辅助队列 */
-    queue = (TreeNode **) malloc(sizeof(TreeNode) * MAX_NODE_SIZE);
+    queue = (TreeNode **)malloc(sizeof(TreeNode) * MAX_NODE_SIZE);
     // 队列指针
     front = 0, rear = 0;
     // 加入根节点
     queue[rear++] = root;
     // 初始化一个列表，用于保存遍历序列
     /* 辅助数组 */
-    arr = (int *) malloc(sizeof(int) * MAX_NODE_SIZE);
+    arr = (int *)malloc(sizeof(int) * MAX_NODE_SIZE);
     // 数组指针
     index = 0;
     while (front < rear) {
@@ -45,7 +45,6 @@ int *levelOrder(TreeNode *root, int *size) {
     return arr;
 }
 
-
 /* Driver Code */
 int main() {
     /* 初始化二叉树 */
@@ -63,4 +62,4 @@ int main() {
     printArray(arr, size);
 
     return 0;
-}
+}

codes/c/chapter_tree/binary_tree_dfs.c

@@ -11,7 +11,8 @@ int *arr;
 
 /* 前序遍历 */
 void preOrder(TreeNode *root, int *size) {
-    if (root == NULL) return;
+    if (root == NULL)
+        return;
     // 访问优先级：根节点 -> 左子树 -> 右子树
     arr[(*size)++] = root->val;
     preOrder(root->left, size);
@@ -20,7 +21,8 @@ void preOrder(TreeNode *root, int *size) {
 
 /* 中序遍历 */
 void inOrder(TreeNode *root, int *size) {
-    if (root == NULL) return;
+    if (root == NULL)
+        return;
     // 访问优先级：左子树 -> 根节点 -> 右子树
     inOrder(root->left, size);
     arr[(*size)++] = root->val;
@@ -29,14 +31,14 @@ void inOrder(TreeNode *root, int *size) {
 
 /* 后序遍历 */
 void postOrder(TreeNode *root, int *size) {
-    if (root == NULL) return;
+    if (root == NULL)
+        return;
     // 访问优先级：左子树 -> 右子树 -> 根节点
     postOrder(root->left, size);
     postOrder(root->right, size);
     arr[(*size)++] = root->val;
 }
 
-
 /* Driver Code */
 int main() {
     /* 初始化二叉树 */
@@ -49,7 +51,7 @@ int main() {
 
     /* 前序遍历 */
     // 初始化辅助数组
-    arr = (int *) malloc(sizeof(int) * MAX_NODE_SIZE);
+    arr = (int *)malloc(sizeof(int) * MAX_NODE_SIZE);
     size = 0;
     preOrder(root, &size);
     printf("前序遍历的节点打印序列 = ");