#include?“stdio.h“?
#include?“string.h“
#include?“stdlib.h“?
#include?“fun.h“
#include?“StdAfx.h“

#define?MAX?20
#define?NULL?0?
#define?OK?1
#define?ERROR?0
#define?STACK_INIT_SIZE?100
#define?OVERFLOW?0
#define?STACKINCREMENT?10
#define?TRUE?1

typedef?struct?BiTNode{?
	char?data;?
	struct?BiTNode?*lchild*rchild;?
}BiTNode*BiTree;?

typedef?struct{
	int?stacksize;
	BiTree?*base;
	BiTree?*top;
}FStack;

void?Create（?BiTree?*T??char?*data??int?&flag?）
{
	CString?input;	
	if（?data[flag]?==?‘#‘?）?{（*T）?=?NULL;flag++;}
	else?
	{	
		（*T）?=?（BiTree）malloc（sizeof（BiTNode））;??//申請節點
		（*T）->data?=?data[flag++];??????????????//生成根節點
		Create（&（*T）->lchild??data?flag）;	????//構造左子樹
		Create（&（*T）->rchild??data?flag）;????//構造右子樹
	
	}
}				//建立二叉樹
						

int?Input（CString?m_input??BiTree?&T?）
{
	int?flag=0;
	
	char?*data?=?（LPSTR）（LPCSTR）m_input;
	
	Create（?&T?data?flag?）;
	return?1;

}

int?InitFStack（?FStack?&S?）??????//初始化棧
{
	int?i=0;

	S.base=?（?BiTree?*?）malloc（?STACK_INIT_SIZE?*?sizeof（?BiTree?）?）;
	if（?!S.base?）?exit（?OVERFLOW?）;
	S.top?=?S.base;
	S.stacksize?=?STACK_INIT_SIZE;
	
	return?OK;
}

BiTree?FGetTop（?FStack?S?）??????????//取得棧頂或者隊列尾的元素
{
	if?（?S.top?==?S.base?）return?NULL;

	return?*（?S.top?-?1?）;
}

int?FPush?（?FStack?&S??BiTree?e?）??????//向棧中壓入數據
{
	if?（?S.top?-?S.base?>=?S.stacksize?）
	{
		S.base?=?（?BiTree?*?）realloc（?S.base??（?S.stacksize??+?STACKINCREMENT?）*sizeof（?BiTree?）?）;
	S.top?=?S.base?+?S.stacksize;
	S.stacksize?+=?STACKINCREMENT;
	}

	*S.top++?=?e;
	return?OK;
}

int?FPop（?FStack?&S??BiTree?&e?）????//取出棧的棧頂數據?或者是取出隊列尾的數據
{
	if?（?S.top?==?S.base?）
		return?ERROR;
	e?=?*--S.top;
	return?OK;
}

void?Preorder（BiTree?TCString?&input）{
	CString?temp;
	
	if（T）{?

		temp.Format（“%c“T->data）;
	
		input+=temp;
		input+=‘?‘;????????????????????????????//訪問根節點，輸出根節點的數據值
		Preorder（T->lchildinput）;????????????//先序遍歷左子樹
		Preorder（T->rchildinput）;????????????//先序遍歷右子樹
	}?
}?????????????????????????//遞歸的方法先序遍歷二叉樹

void?zhongxu（BiTree?T?CString?&input）{?
	CString?temp;
	if（T）{?
		zhongxu（T->lchildinput）;?????????//中序遍歷左子樹
		temp.Format（“%c“T->data）;????????//訪問根節點，輸出根節點的數據值
		input+=temp;
		input+=‘?‘;??????????????????????
		zhongxu（T->rchildinput）;?????????//中序遍歷右子樹
	}?
}??????????????????????//遞歸的方法中序遍歷二叉樹
?
void?zhongxu2（BiTree?T?CString?&input）{
	CString?temp;
	FStack?S;
	InitFStack（S）;
	BiTree?p;
	p=T;
	while（p||（S.base!=S.top））
	{
		if（p!=NULL）{
			FPush（Sp）;
			p=p->lchild;
		}
		else{
			FPop（Sp）;
			temp.Format（“%c“p->data）;
			input+=temp;
			input+=‘?‘;
			p=p->rchild;
		}
	}


???????????????????????????????????????//非遞歸的方法中序遍歷二叉樹
}


void?houxu（BiTree?T?CString?&input）{?
CString?temp;
	if（T）{?
		houxu（T->lchildinput）;?
		houxu（T->rchildinput）;?
		temp.Format（“%c“T->data）;????????//訪問根節點，輸出根節點的數據值
		input+=temp;
		input+=‘?‘;??
	}?
}????????????????

?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----

?????文件???????1475??2011-04-20?21:14??二叉樹\二叉樹.clw

?????文件???????3567??2011-04-20?15:48??二叉樹\ReadMe.txt

?????文件???????1286??2011-04-20?15:48??二叉樹\二叉樹.h

?????文件???????2019??2011-04-20?15:48??二叉樹\二叉樹.cpp

?????文件???????1054??2011-04-20?15:48??二叉樹\StdAfx.h

?????文件????????208??2011-04-20?15:48??二叉樹\StdAfx.cpp

?????文件????????398??2011-04-20?15:48??二叉樹\res\二叉樹.rc2

?????文件???????1078??2011-04-20?15:48??二叉樹\res\二叉樹.ico

?????文件??????58368??2011-04-20?21:14??二叉樹\二叉樹.ncb

?????文件???????2880??2011-04-20?20:39??二叉樹\Debug\二叉樹.res

?????文件?????214016??2011-04-20?21:14??二叉樹\Debug\vc60.idb

?????文件????5502316??2011-04-20?16:25??二叉樹\Debug\二叉樹.pch

?????文件?????372736??2011-04-20?21:14??二叉樹\Debug\vc60.pdb

?????文件?????105812??2011-04-20?16:25??二叉樹\Debug\StdAfx.obj

?????文件?????402432??2011-04-20?21:14??二叉樹\Debug\二叉樹.pdb

?????文件?????114780??2011-04-20?21:14??二叉樹\Debug\二叉樹.exe

?????文件?????248508??2011-04-20?21:14??二叉樹\Debug\二叉樹.ilk

?????文件??????14871??2011-04-20?20:39??二叉樹\Debug\二叉樹.obj

?????文件??????17550??2011-04-20?20:58??二叉樹\Debug\fun.obj

?????文件??????37769??2011-04-20?21:14??二叉樹\Debug\二叉樹Dlg.obj

?????文件????????520??2011-04-20?15:57??二叉樹\二叉樹.dsw

?????文件????????987??2011-04-20?21:14??二叉樹\二叉樹.plg

?????文件???????1557??2011-04-20?20:36??二叉樹\二叉樹Dlg.h

?????文件????????820??2011-04-20?20:39??二叉樹\fun.h

?????文件???????1190??2011-04-20?20:39??二叉樹\Resource.h

?????文件??????36256??2011-04-20?20:39??二叉樹\二叉樹.aps

?????文件???????5941??2011-04-20?20:39??二叉樹\二叉樹.rc

?????文件???????3735??2011-04-20?20:58??二叉樹\fun.cpp

?????文件???????6401??2011-04-20?21:13??二叉樹\二叉樹Dlg.cpp

?????文件???????4288??2011-04-20?21:13??二叉樹\二叉樹.dsp

............此處省略7個文件信息