Unify the naming of the C codes.

codes/c/include/include_test.c

@@ -9,24 +9,24 @@
 void testListNode() {
     int nums[] = {2, 3, 5, 6, 7};
     int size = sizeof(nums) / sizeof(int);
-    ListNode *head = ArrayToLinkedList(nums, size);
-    PrintLinkedList(head);
+    ListNode *head = arrToLinkedList(nums, size);
+    printLinkedList(head);
 
-    ListNode *node = GetListNode(head, 5);
+    ListNode *node = getListNode(head, 5);
     printf("find node: %d\n", node->val);
 }
 
 void testTreeNode() {
     int nums[] = {1, 2, 3, NIL, 5, 6, NIL};
     int size = sizeof(nums) / sizeof(int);
-    TreeNode *root = ArrayToTree(nums, size);
+    TreeNode *root = arrToTree(nums, size);
 
     // print tree
-    PrintTree(root);
+    printTree(root);
 
     // tree to arr
-    int *arr = TreeToArray(root);
-    PrintArray(arr, size);
+    int *arr = treeToArr(root);
+    printArray(arr, size);
 }
 
 int main(int argc, char *argv[]) {

codes/c/include/list_node.h

@@ -22,7 +22,7 @@ struct ListNode {
 // typedef 为 C 语言的关键字，作用是为一种数据类型定义一个新名字
 typedef struct ListNode ListNode;
 
-ListNode *NewListNode(int val) {
+ListNode *newListNode(int val) {
     ListNode *node, *next;
     node = (ListNode *) malloc(sizeof(ListNode));
     node->val = val;
@@ -37,15 +37,15 @@ ListNode *NewListNode(int val) {
  * @return ListNode*
  */
 
-ListNode *ArrayToLinkedList(const int *arr, size_t size) {
+ListNode *arrToLinkedList(const int *arr, size_t size) {
     if (size <= 0) {
         return NULL;
     }
 
-    ListNode *dummy = NewListNode(0);
+    ListNode *dummy = newListNode(0);
     ListNode *node = dummy;
     for (int i = 0; i < size; i++) {
-        node->next = NewListNode(arr[i]);
+        node->next = newListNode(arr[i]);
         node = node->next;
     }
     return dummy->next;
@@ -58,7 +58,7 @@ ListNode *ArrayToLinkedList(const int *arr, size_t size) {
  * @param val
  * @return ListNode*
  */
-ListNode *GetListNode(ListNode *head, int val) {
+ListNode *getListNode(ListNode *head, int val) {
     while (head != NULL && head->val != val) {
         head = head->next;
     }

codes/c/include/print_util.h

@@ -25,7 +25,7 @@ extern "C" {
  * @param arr
  * @param size
  */
-static void PrintArray(int *arr, int size) {
+static void printArray(int *arr, int size) {
     printf("[");
     for (int i = 0; i < size - 1; i++) {
         if (arr[i] != NIL) {
@@ -46,7 +46,7 @@ static void PrintArray(int *arr, int size) {
  *
  * @param head
  */
-static void PrintLinkedList(ListNode *node) {
+static void printLinkedList(ListNode *node) {
     if (node == NULL) {
         return;
     }
@@ -123,7 +123,7 @@ static void printTreeHelper(TreeNode *node, Trunk *prev, bool isLeft) {
  *
  * @param head
  */
-static void PrintTree(TreeNode *root) {
+static void printTree(TreeNode *root) {
     printTreeHelper(root, NULL, false);
 }
 

codes/c/include/tree_node.h

@@ -25,7 +25,7 @@ struct TreeNode {
 typedef struct TreeNode TreeNode;
 
 
-TreeNode *NewTreeNode(int val) {
+TreeNode *newTreeNode(int val) {
     TreeNode *node;
 
     node = (TreeNode *) malloc(sizeof(TreeNode));
@@ -43,7 +43,7 @@ TreeNode *NewTreeNode(int val) {
  * @param size
  * @return TreeNode *
  */
-TreeNode *ArrayToTree(const int *arr, size_t size) {
+TreeNode *arrToTree(const int *arr, size_t size) {
     if (size <= 0) {
         return NULL;
     }
@@ -53,7 +53,7 @@ TreeNode *ArrayToTree(const int *arr, size_t size) {
     TreeNode **queue;
 
     /* 根结点 */
-    root = NewTreeNode(arr[0]);
+    root = newTreeNode(arr[0]);
     /* 辅助队列 */
     queue = (TreeNode **) malloc(sizeof(TreeNode) * MAX_NODE_SIZE);
     // 队列指针
@@ -68,14 +68,14 @@ TreeNode *ArrayToTree(const int *arr, size_t size) {
         index++;
         if (index < size) {
             if (arr[index] != NIL) {
-                node->left = NewTreeNode(arr[index]);
+                node->left = newTreeNode(arr[index]);
                 queue[rear++] = node->left;
             }
         }
         index++;
         if (index < size) {
             if (arr[index] != NIL) {
-                node->right = NewTreeNode(arr[index]);
+                node->right = newTreeNode(arr[index]);
                 queue[rear++] = node->right;
             }
         }
@@ -91,7 +91,7 @@ TreeNode *ArrayToTree(const int *arr, size_t size) {
  * @param size
  * @return TreeNode *
  */
-int *TreeToArray(TreeNode *root) {
+int *treeToArr(TreeNode *root) {
     if (root == NULL) {
         return NULL;
     }