From d2c422c68b8c0be31688ff5bd4ed7f06c2f11083 Mon Sep 17 00:00:00 2001
From: jdh <24016020834@stu.nsu.edu.cn>
Date: Wed, 30 Apr 2025 14:24:13 +0800
Subject: [PATCH] up binary.c
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

实现了二叉树的dfs遍历

Co-Authored-By: Jdhggg <111557398+Jdhggg@users.noreply.github.com>
---
 binary_tree.c | 9 +++++++++
 binary_tree.h | 1 +
 main.c        | 2 +-
 3 files changed, 11 insertions(+), 1 deletion(-)

diff --git a/binary_tree.c b/binary_tree.c
index 5057064..b6e2a64 100644
--- a/binary_tree.c
+++ b/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); 
 }
\ No newline at end of file
diff --git a/binary_tree.h b/binary_tree.h
index 62eb1f3..b1f4e35 100644
--- a/binary_tree.h
+++ b/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
diff --git a/main.c b/main.c
index d3b53e0..7ab1bed 100644
--- a/main.c
+++ b/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;