up binary.c

实现了二叉树的dfs遍历

Co-Authored-By: Jdhggg <111557398+Jdhggg@users.noreply.github.com>

binary_tree.c

@@ -58,4 +58,13 @@ void traverse_tree(tree_node *roots)
        roots = queue[front];
        front = (front+1) % 3;
     }
+}
+// dfs遍历
+void traverse_tree_dfs(tree_node *roots)
+{
+   if (roots == NULL)         
+        return;
+    printf("%d\n",roots->value);
+    traverse_tree_dfs(roots->left);
+    traverse_tree_dfs(roots->right); 
 }

binary_tree.h

@@ -15,4 +15,5 @@ void insert_tree_node(tree_node *node,tree_node *node_new);
 void delete_node(tree_node *node);
 // 遍历树节点
 void traverse_tree(tree_node *roots);
+void traverse_tree_dfs(tree_node *roots);
 #endif // DEBUG

main.c

@@ -114,7 +114,7 @@ int main(void) {
   node1->right = node4;
   node2->left = node5;
   node2->right = node6;
-  traverse_tree(root);
+  traverse_tree_dfs(root);
   printf("Hello World!\n");
   system("pause");
   return 0;