From ae188682597034222e694d9c4faf6948473376f2 Mon Sep 17 00:00:00 2001
From: ViolentAyang <76544389+ViolentAyang@users.noreply.github.com>
Date: Fri, 15 Apr 2022 11:02:15 +0800
Subject: [PATCH] =?UTF-8?q?Create=20=E4=BA=8C=E5=8F=89=E6=A0=91=E7=9A=84?=
 =?UTF-8?q?=E5=89=8D=E4=B8=AD=E5=90=8E=E5=BA=8F=E9=81=8D=E5=8E=86.c?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 树/二叉树的前中后序遍历.c | 51 +++++++++++++++++++++++++++++++++++++++
 1 file changed, 51 insertions(+)
 create mode 100644 树/二叉树的前中后序遍历.c

diff --git a/树/二叉树的前中后序遍历.c b/树/二叉树的前中后序遍历.c
new file mode 100644
index 0000000..40860ba
--- /dev/null
+++ b/树/二叉树的前中后序遍历.c
@@ -0,0 +1,51 @@
+#include<stdio.h>
+#include<stdlib.h>
+#include<stdbool.h>
+
+typedef struct BiTNode{
+	int data;
+	struct BiTNode *lchild,*rchild; 
+}BiTNode,*BiTree;
+
+void InitTree(BiTree T,int m){
+	T = (BiTree)malloc(sizeof(BiTNode));
+	T->data = m;
+	T->lchild = NULL;
+	T->rchild = NULL;
+}
+
+void visit(BiTree T){
+	printf("%d\t",T->data);
+}
+
+//前序遍历
+void PreOrder(BiTree T){
+	if(T!=NULL){
+		visit(T);
+		PreOrder(T->lchild);
+		PreOrder(T->rchild);
+	}
+}
+
+//中序遍历
+void InOrder(BiTree T){
+	if(T!=NULL){
+		InOrder(T->lchild);
+		visit(T);
+		InOrder(T->rchild);
+	}
+}
+
+//后序遍历
+void PostOrder(BiTree T){
+	if(T!=NULL){
+		PostOrder(T->lchild);
+		PostOrder(T->rchild);
+		visit(T);
+	}
+}
+
+int main(){
+	
+	return 0;
+}