idk why these stuffs get stashed for so long and I didn't ever commit them

Exercise/BiTreeExterned/BiTreeExterned.sln

@@ -0,0 +1,31 @@
+
+Microsoft Visual Studio Solution File, Format Version 12.00
+# Visual Studio Version 17
+VisualStudioVersion = 17.9.34728.123
+MinimumVisualStudioVersion = 10.0.40219.1
+Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "BiTreeExterned", "BiTreeExterned.vcxproj", "{67DB3E23-69FE-496E-B980-2F234B1777BA}"
+EndProject
+Global
+	GlobalSection(SolutionConfigurationPlatforms) = preSolution
+		Debug|x64 = Debug|x64
+		Debug|x86 = Debug|x86
+		Release|x64 = Release|x64
+		Release|x86 = Release|x86
+	EndGlobalSection
+	GlobalSection(ProjectConfigurationPlatforms) = postSolution
+		{67DB3E23-69FE-496E-B980-2F234B1777BA}.Debug|x64.ActiveCfg = Debug|x64
+		{67DB3E23-69FE-496E-B980-2F234B1777BA}.Debug|x64.Build.0 = Debug|x64
+		{67DB3E23-69FE-496E-B980-2F234B1777BA}.Debug|x86.ActiveCfg = Debug|Win32
+		{67DB3E23-69FE-496E-B980-2F234B1777BA}.Debug|x86.Build.0 = Debug|Win32
+		{67DB3E23-69FE-496E-B980-2F234B1777BA}.Release|x64.ActiveCfg = Release|x64
+		{67DB3E23-69FE-496E-B980-2F234B1777BA}.Release|x64.Build.0 = Release|x64
+		{67DB3E23-69FE-496E-B980-2F234B1777BA}.Release|x86.ActiveCfg = Release|Win32
+		{67DB3E23-69FE-496E-B980-2F234B1777BA}.Release|x86.Build.0 = Release|Win32
+	EndGlobalSection
+	GlobalSection(SolutionProperties) = preSolution
+		HideSolutionNode = FALSE
+	EndGlobalSection
+	GlobalSection(ExtensibilityGlobals) = postSolution
+		SolutionGuid = {313D7A25-E7B0-4ED7-BCA3-EFCA771BB40E}
+	EndGlobalSection
+EndGlobal

Exercise/BiTreeExterned/BiTreeExterned.vcxproj

@@ -0,0 +1,138 @@
+<?xml version="1.0" encoding="utf-8"?>
+<Project DefaultTargets="Build" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
+  <ItemGroup Label="ProjectConfigurations">
+    <ProjectConfiguration Include="Debug|Win32">
+      <Configuration>Debug</Configuration>
+      <Platform>Win32</Platform>
+    </ProjectConfiguration>
+    <ProjectConfiguration Include="Release|Win32">
+      <Configuration>Release</Configuration>
+      <Platform>Win32</Platform>
+    </ProjectConfiguration>
+    <ProjectConfiguration Include="Debug|x64">
+      <Configuration>Debug</Configuration>
+      <Platform>x64</Platform>
+    </ProjectConfiguration>
+    <ProjectConfiguration Include="Release|x64">
+      <Configuration>Release</Configuration>
+      <Platform>x64</Platform>
+    </ProjectConfiguration>
+  </ItemGroup>
+  <PropertyGroup Label="Globals">
+    <VCProjectVersion>17.0</VCProjectVersion>
+    <Keyword>Win32Proj</Keyword>
+    <ProjectGuid>{67db3e23-69fe-496e-b980-2f234b1777ba}</ProjectGuid>
+    <RootNamespace>BiTreeExterned</RootNamespace>
+    <WindowsTargetPlatformVersion>10.0</WindowsTargetPlatformVersion>
+  </PropertyGroup>
+  <Import Project="$(VCTargetsPath)\Microsoft.Cpp.Default.props" />
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'" Label="Configuration">
+    <ConfigurationType>Application</ConfigurationType>
+    <UseDebugLibraries>true</UseDebugLibraries>
+    <PlatformToolset>v143</PlatformToolset>
+    <CharacterSet>Unicode</CharacterSet>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'" Label="Configuration">
+    <ConfigurationType>Application</ConfigurationType>
+    <UseDebugLibraries>false</UseDebugLibraries>
+    <PlatformToolset>v143</PlatformToolset>
+    <WholeProgramOptimization>true</WholeProgramOptimization>
+    <CharacterSet>Unicode</CharacterSet>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'" Label="Configuration">
+    <ConfigurationType>Application</ConfigurationType>
+    <UseDebugLibraries>true</UseDebugLibraries>
+    <PlatformToolset>v143</PlatformToolset>
+    <CharacterSet>Unicode</CharacterSet>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'" Label="Configuration">
+    <ConfigurationType>Application</ConfigurationType>
+    <UseDebugLibraries>false</UseDebugLibraries>
+    <PlatformToolset>v143</PlatformToolset>
+    <WholeProgramOptimization>true</WholeProgramOptimization>
+    <CharacterSet>Unicode</CharacterSet>
+  </PropertyGroup>
+  <Import Project="$(VCTargetsPath)\Microsoft.Cpp.props" />
+  <ImportGroup Label="ExtensionSettings">
+  </ImportGroup>
+  <ImportGroup Label="Shared">
+  </ImportGroup>
+  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <PropertyGroup Label="UserMacros" />
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
+    <ClCompile>
+      <WarningLevel>Level3</WarningLevel>
+      <SDLCheck>true</SDLCheck>
+      <PreprocessorDefinitions>WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <ConformanceMode>true</ConformanceMode>
+    </ClCompile>
+    <Link>
+      <SubSystem>Console</SubSystem>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
+    <ClCompile>
+      <WarningLevel>Level3</WarningLevel>
+      <FunctionLevelLinking>true</FunctionLevelLinking>
+      <IntrinsicFunctions>true</IntrinsicFunctions>
+      <SDLCheck>true</SDLCheck>
+      <PreprocessorDefinitions>WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <ConformanceMode>true</ConformanceMode>
+    </ClCompile>
+    <Link>
+      <SubSystem>Console</SubSystem>
+      <EnableCOMDATFolding>true</EnableCOMDATFolding>
+      <OptimizeReferences>true</OptimizeReferences>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
+    <ClCompile>
+      <WarningLevel>Level3</WarningLevel>
+      <SDLCheck>false</SDLCheck>
+      <PreprocessorDefinitions>_DEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <ConformanceMode>true</ConformanceMode>
+    </ClCompile>
+    <Link>
+      <SubSystem>Console</SubSystem>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
+    <ClCompile>
+      <WarningLevel>Level3</WarningLevel>
+      <FunctionLevelLinking>true</FunctionLevelLinking>
+      <IntrinsicFunctions>true</IntrinsicFunctions>
+      <SDLCheck>true</SDLCheck>
+      <PreprocessorDefinitions>NDEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <ConformanceMode>true</ConformanceMode>
+    </ClCompile>
+    <Link>
+      <SubSystem>Console</SubSystem>
+      <EnableCOMDATFolding>true</EnableCOMDATFolding>
+      <OptimizeReferences>true</OptimizeReferences>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemGroup>
+    <ClCompile Include="bitree.cpp" />
+  </ItemGroup>
+  <ItemGroup>
+    <ClInclude Include="bitree.h" />
+  </ItemGroup>
+  <Import Project="$(VCTargetsPath)\Microsoft.Cpp.targets" />
+  <ImportGroup Label="ExtensionTargets">
+  </ImportGroup>
+</Project>

Exercise/BiTreeExterned/BiTreeExterned.vcxproj.filters

@@ -0,0 +1,27 @@
+<?xml version="1.0" encoding="utf-8"?>
+<Project ToolsVersion="4.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
+  <ItemGroup>
+    <Filter Include="源文件">
+      <UniqueIdentifier>{4FC737F1-C7A5-4376-A066-2A32D752A2FF}</UniqueIdentifier>
+      <Extensions>cpp;c;cc;cxx;c++;cppm;ixx;def;odl;idl;hpj;bat;asm;asmx</Extensions>
+    </Filter>
+    <Filter Include="头文件">
+      <UniqueIdentifier>{93995380-89BD-4b04-88EB-625FBE52EBFB}</UniqueIdentifier>
+      <Extensions>h;hh;hpp;hxx;h++;hm;inl;inc;ipp;xsd</Extensions>
+    </Filter>
+    <Filter Include="资源文件">
+      <UniqueIdentifier>{67DA6AB6-F800-4c08-8B7A-83BB121AAD01}</UniqueIdentifier>
+      <Extensions>rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe;resx;tiff;tif;png;wav;mfcribbon-ms</Extensions>
+    </Filter>
+  </ItemGroup>
+  <ItemGroup>
+    <ClCompile Include="bitree.cpp">
+      <Filter>源文件</Filter>
+    </ClCompile>
+  </ItemGroup>
+  <ItemGroup>
+    <ClInclude Include="bitree.h">
+      <Filter>头文件</Filter>
+    </ClInclude>
+  </ItemGroup>
+</Project>

Exercise/BiTreeExterned/bitree.cpp

@@ -0,0 +1,136 @@
+#include<iostream>//cout,cin
+#include<string>
+using namespace std;
+#include"bitree.h"
+
+//测试参考数据
+string  fbt = "a b d # # e # # c f # # g # #";					// 满二叉树最后一层每个叶结点后有两个#
+string  cbt = "a b d # # e # # c # #";							// 完全二叉树每个叶结点后有两个#
+string  gbt = "a b # d # # c e # # #";							// 一般二叉树
+string  obt = "a b c d # # # # #";								// 左斜树1
+
+
+void dispmenu()
+{																//显示主菜单
+	cout << endl;
+	cout << "1-创建二叉树\n";
+	cout << "2-先序递归遍历二叉树\n";
+	cout << "3-中序递归遍历二叉树\n";
+	cout << "4-后序递归遍历二叉树\n";
+	cout << "5-层序遍历二叉树\n";
+	cout << "6-先序非递归遍历二叉树\n";
+	cout << "7-中序非递归遍历二叉树\n";
+	cout << "8-后序非递归遍历二叉树\n";
+	cout << "9-结点查询\n";
+	cout << "10-求二叉树高度\n";
+	cout << "11-求二叉树结点个数\n";
+	cout << "12-显示二叉树\n";
+	cout << "13-删除以值为x的结点的子树\n";
+	cout << "0 -退出\n";
+}
+
+int main()
+{
+	int level;
+	BTNode<char>* bt;
+
+	system("cls");													// 清屏
+
+	int choice;
+	do
+	{
+		dispmenu();													// 显示主菜单
+		cout << "Enter choice(1~12，0 退出):";
+		cin >> choice;
+		switch (choice)
+		{
+		case 1:													// 创建二叉树 
+			cout << "测试参考数据：" << endl;
+			cout << "满二叉树：" << fbt << endl;
+			cout << "完全二叉树：" << cbt << endl;
+			cout << "一般二叉树：" << gbt << endl;
+			cout << "左斜二叉树：" << obt << endl;
+			cout << "请按先序序列的顺序输入二叉树,#为空指针域标志：" << endl;
+			CreateBiTree(bt);
+			break;
+		case 2:												// 先序递归遍历二叉树
+			cout << "先序遍历序列为：" << endl;
+			PreOrDerBiTree(bt);
+			break;
+		case 3:													// 中序递归遍历二叉树
+			cout << "中序遍历序列为：" << endl;
+			InOrDerBiTree(bt);
+			cout << endl;
+			break;
+		case 4:												// 后序递归遍历二叉树
+			cout << "后序遍历序列为：" << endl;
+			PostOrDerBiTree(bt);
+			cout << endl;
+			break;
+		case 5:												// 层序遍历二叉树
+			cout << "层序遍历序列为：" << endl;
+			cout << endl;
+			LevelBiTree(bt);
+			break;
+		case 6:												// 先序非递归遍历二叉树
+			cout << "先序非递归遍历序列为：" << endl;
+			PreOrderBiTree_N(bt);
+			cout << endl;
+			break;
+		case 7:												// 中序非递归遍历二叉树
+			cout << "中序非递归遍历序列为：" << endl;
+			InOrderBiTree_N(bt);
+			cout << endl;
+			break;
+		case 8:												// 后序非递归遍历二叉树
+			cout << "后序非递归遍历序列为：" << endl;
+			cout << endl;
+			PostOrderBiTree_N(bt);
+			break;
+		case 9:												// 结点查询
+			char e;
+			BTNode<char>* p;
+			cout << "输入要查询的结点值：" << endl;
+			cin >> e;
+			p = Search(bt, e);
+			if (p)
+			{
+				cout << "找到！";
+				cout << p->data << endl;
+			}
+			else
+				cout << "未找到！" << endl;
+			cout << endl;
+			break;
+		case 10:												// 求二叉树高度
+			cout << "二叉树高度为：" << Depth(bt) << endl;
+			cout << endl;
+			break;
+		case 11:												//求二叉树结点个数
+			cout << "二叉树结点数为：" << NodeCount(bt) << endl;
+			cout << endl;
+			break;
+		case 12:												// 显示二叉树
+			cout << "2-显示二叉树" << endl;
+			level = 1;
+			DispBiTree(bt, level);
+			cout << endl;
+			break;
+		case 13:
+			cout << "输入结点的值：";
+			char x;
+			cin >> x;
+			DelChildWithRootX(bt, x);
+			break;
+		case 0:												// 退出
+			DestroyBiTree(bt);
+			cout << "结束运行Bye-Bye!" << endl;
+			break;
+		default:												// 无效选择
+			cout << "Invalid choice\n";
+			break;
+		}
+	} while (choice != 0);
+
+	return 0;
+}

Exercise/BiTreeExterned/bitree.h

@@ -0,0 +1,436 @@
+template <class DT>
+struct BTNode
+{
+	DT data;		                			//数据域
+	BTNode* lchild;								//指向左子树的指针
+	BTNode* rchild;								//指向右子树的指针
+};
+
+//队列工具
+template <class DT>
+struct SqQueue											// 顺序队类
+{
+	BTNode<DT>** base;									// 队列首址
+	int front;											// 队头指针
+	int rear;											// 队尾指针
+	int queuesize;										// 队容量
+};
+
+//栈
+template <class DT>
+struct SqStack										// 顺序栈
+{
+	BTNode<DT>** base;								// 栈首址
+	int top;										// 栈顶指针
+	int stacksize;									// 栈容量
+};
+
+//算法5.1										先序遍历递归算法
+template <class DT>
+void PreOrDerBiTree(BTNode<DT>* bt)
+{
+	if (bt != NULL)
+	{
+		cout << bt->data << ' ';	     			//输出结点上的数据
+		PreOrDerBiTree(bt->lchild);				//递归的调用前序遍历左子树
+		PreOrDerBiTree(bt->rchild);				//递归的调用前序遍历右子树
+	}
+	return;
+}
+
+//算法5.2										中序遍历递归算法
+template <class DT>
+void InOrDerBiTree(BTNode<DT>* bt)
+{
+	if (bt != NULL)
+	{
+		InOrDerBiTree(bt->lchild);				//递归的调用中序遍历左子树
+		cout << bt->data << ' ';	     			//输出结点上的数据
+		InOrDerBiTree(bt->rchild);  			//递归的调用中序遍历右子树
+	}
+	return;
+}
+
+//算法5.3										后序遍历递归算法
+template <class DT>
+void PostOrDerBiTree(BTNode<DT>* bt)
+{
+	if (bt != NULL)
+	{
+		PostOrDerBiTree(bt->lchild);			//递归的调用后序遍历左子树
+		PostOrDerBiTree(bt->rchild);			//递归的调用后序遍历右子树
+		cout << bt->data << ' ';					//输出结点上的数据
+	}
+	return;
+}
+
+
+//算法5.4										层序遍历算法	
+template<class DT>
+void LevelBiTree(BTNode<DT>* bt)
+{
+	SqQueue<DT> Q;								// 创建一个队
+	int m = 20;
+	InitQueue(Q, m);
+	BTNode<DT>* p;
+	p = bt;
+	if (p) EnQueue(Q, p);							// 树非空，入队              
+	while (!QueueEmpty(Q))						// 队非空
+	{
+		DeQueue(Q, p);							// 出队
+		cout << p->data;							// 访问
+		if (p->lchild != NULL)						// 有左孩子
+			EnQueue(Q, p->lchild);				// 左孩子入队
+		if (p->rchild != NULL)						// 有右孩子
+			EnQueue(Q, p->rchild);				// 右孩子入队
+	}
+	DestroyQueue(Q);							// 销毁队列
+}
+
+
+//算法5.5										先序非遍历递归算法
+template <class DT>
+void PreOrderBiTree_N(BTNode<DT>* bt)
+{
+	SqStack<DT> S;								// 创建栈
+	int m = 20;
+	InitStack(S, m);
+	BTNode<DT>* p;
+	p = bt;
+	while (p != NULL || !StackEmpty(S))			// 树非空或栈非空
+	{
+		while (p != NULL)							// 结点非空
+		{
+			cout << p->data << ' ';					// 访问结点
+			Push(S, p);							// 入栈
+			p = p->lchild;						// 转左子树
+		}
+		if (!StackEmpty(S))						// 栈非空
+		{
+			Pop(S, p);							// 出栈
+			p = p->rchild;						    // 转出栈结点的右子树
+		}
+	}
+	DestroyStack(S);							//销毁栈
+}
+
+
+//算法5.6 中序非遍历递归算法
+template <class DT>
+void InOrderBiTree_N(BTNode<DT>* bt)
+{
+	SqStack<DT> S;								// 创建一个栈
+	int m = 20;
+	InitStack(S, m);
+	BTNode<DT>* p;
+	p = bt;
+	while (p != NULL || !StackEmpty(S))			// 结点非空或栈非空
+	{
+		while (p != NULL)							// 结点非空
+		{
+			Push(S, p);							// 入栈
+			p = p->lchild;						// 转出栈结点右子树
+		}
+		if (!StackEmpty(S))						// 栈非空
+		{
+			Pop(S, p);							// 出栈
+			cout << p->data << ' ';					// 访问出栈结点
+			p = p->rchild;						// 转出栈结点的右子树
+		}
+	}
+	DestroyStack(S);							// 销毁栈
+}
+
+
+
+//算法5.7										后序非遍历递归算法
+template <class DT>
+void PostOrderBiTree_N(BTNode<DT>* bt)
+{
+	SqStack<DT> S;								// 创建一个栈
+	int m = 20;
+	InitStack(S, m);
+	BTNode<DT>* p;
+	BTNode<DT>* r;
+	p = bt;
+	bool flag;
+	do
+	{
+		while (p)								// 结点非空
+		{
+			Push(S, p);							// 结点入栈
+			p = p->lchild;						// 转左子树
+		}
+		r = NULL;									// 指向刚被访问点，初值为空
+		flag = true;								// true表示处理栈顶结点                     
+		while (!StackEmpty(S) && flag)			// 栈非空且当前处理的是栈顶结点
+		{
+			GetTop(S, p);						// 获取栈顶元素
+			if (p->rchild == r)					// 如果 当前结点是栈元素的右孩子
+			{
+				cout << p->data << ' ';				// 访问栈顶元素
+				Pop(S, p);						// 出栈
+				r = p;							// r指向被访问结点
+			}
+			else								 // 否则
+			{
+				p = p->rchild;					// 转栈顶元素右孩子
+				flag = false;						// 处理非栈顶结点
+			}
+		}
+	} while (!StackEmpty(S));						// 栈非空，循环
+	cout << endl;
+	DestroyStack(S);							// 销毁栈
+}
+
+
+//算法5.8                                      创建二叉树
+template <class DT>
+void CreateBiTree(BTNode<DT>*& bt)
+{
+	char ch;
+	cin >> ch;				                    // 输入根结点的数据
+	if (ch == '#')                                 // # 表示指针为空，说明树为空
+		bt = NULL;
+	else
+	{
+		bt = new BTNode<DT>;	                    // 申请内存
+		if (!bt)
+		{
+			cout << "申请内存失败！" << endl;
+			exit(-1);                           // 申请内存失败退出
+		}
+		bt->data = ch;
+		CreateBiTree(bt->lchild);               // 创建根结点左子树
+		CreateBiTree(bt->rchild);               // 创建根结点右子树
+	}
+	return;
+}
+
+
+//算法5.9 销毁二叉树
+template <class DT>
+void DestroyBiTree(BTNode<DT>*& bt)
+{
+	if (bt)                                     // 树非空
+	{
+		DestroyBiTree(bt->lchild);             // 销毁左子树
+		DestroyBiTree(bt->rchild);             // 销毁右子树
+		delete bt;
+	}
+}
+
+
+//算法5.10										结点查找
+
+template<class DT>
+BTNode<DT>* Search(BTNode<DT>* bt, DT e)		// 查找值为e的元素
+{
+	BTNode<DT>* p;
+	if (bt == NULL)								// 结点为空，返回
+		return NULL;
+	else if (bt->data == e)						// 找到，返回结点指针
+		return bt;
+	else										// 结点值不为e       
+	{
+		p = Search(bt->lchild, e);					// 在左子树上查找
+		if (p != NULL)								// 找到
+			return p;							// 返回结点指针
+		else									// 未找到
+			return Search(bt->rchild, e);		// 转右子树上查找
+	}
+}
+
+//算法5.11										求树深
+template <class DT>
+int Depth(BTNode<DT>* bt)
+{
+	int hl, hr;
+	if (bt == NULL)								// 树空
+		return 0;								// 深度为0
+	else										// 树非空
+	{
+
+		hl = Depth(bt->lchild);					// 求左子树深度
+		hr = Depth(bt->lchild);					// 求右子树深度
+		if (hl > hr)								// 左子树高
+			return hl + 1;						// 树高为左子树高加1
+		else return hr + 1;						// 左子树高,树高为左子树高加1
+	}
+}
+
+
+//算法5.12										结点计数
+template <class DT>
+int NodeCount(BTNode<DT>* bt)
+{
+	if (bt == NULL)								// 空树，结点数为0
+		return 0;
+	else										// 非空树，结点数为左、右子树结点数的和加1
+		return NodeCount(bt->lchild) + NodeCount(bt->rchild) + 1;
+}
+
+template <class DT>
+void DispBiTree(BTNode<DT>* bt, int level)        // 显示树
+{
+	if (bt)                                        //空二叉树不显示
+	{
+		DispBiTree(bt->rchild, level + 1);              //显示右子树
+		cout << endl;                                  //显示新行
+		for (int i = 0; i < level - 1; i++)
+			cout << "   ";                              //确保在第level列显示节点
+		cout << bt->data;                              //显示节点
+		DispBiTree(bt->lchild, level + 1);              //显示左子树  
+		cout << endl;
+	}//if
+}
+
+template <class DT>
+void DelChildWithRootX(BTNode<DT>*& bt, DT x) {
+	if (bt == NULL) return;
+	else {
+		if (bt->data == x) {
+			DestroyBiTree(bt);
+			bt = NULL;
+			return;
+		}
+		else {
+			DelChildWithRootX(bt->lchild, x);
+			DelChildWithRootX(bt->rchild, x);
+		}
+	}
+}
+
+template <class DT>
+int leftCount(BTNode<DT>* bt)
+{
+	if (bt->lchild == NULL && bt->rchild == NULL)								// 空树，结点数为0
+		return 0;
+	else										// 非空树，结点数为左、右子树结点数的和加1
+		return NodeCount(bt->lchild) + NodeCount(bt->rchild) + 1;
+}
+
+
+//【算法3.14】											初始化队列
+template <class DT>
+void InitQueue(SqQueue<DT>& Q, int m)
+{
+	Q.base = new BTNode<DT>*[m];							// 申请队列空间
+	if (Q.base == NULL)									// 申请空间失败
+	{
+		cout << "未创建成功！";
+		exit(1);										// 退出
+	}
+	Q.front = Q.rear = 0;									// 设置队列属性 
+	Q.queuesize = m;
+}
+
+
+//算法3.15】											销毁列列
+template <class DT>
+void DestroyQueue(SqQueue<DT>& Q)
+{
+	delete[] Q.base;									// 释放队列空间
+	Q.front = Q.rear = 0;									// 设置队列属性
+	Q.queuesize = 0;
+}
+
+
+//【算法3.16】											入队
+template<class DT>
+bool EnQueue(SqQueue<DT>& Q, BTNode<DT>* e)
+{
+	if ((Q.rear + 1) % Q.queuesize == Q.front)					// 队满
+		return false;									// 返回false
+	Q.base[Q.rear] = e;									// 出队
+	Q.rear = (Q.rear + 1) % Q.queuesize;						// 修改队列属性
+	return true;										// 返回true
+}
+
+//【算法3.17】											出队
+template<class DT>
+bool DeQueue(SqQueue<DT>& Q, BTNode<DT>*& e)
+{
+	if (Q.front == Q.rear)									// 队空
+		return false;
+	e = Q.base[Q.front];
+	Q.front = (Q.front + 1) % Q.queuesize;
+	return true;										// 删除成功，返回true
+}
+
+// 测队空
+template<class DT>
+bool QueueEmpty(SqQueue<DT> Q)
+{
+	if (Q.front == Q.rear)									// 队空
+		return true;									// 返回true
+	else												// 队不空
+		return false;									// 返回false
+}
+
+//【算法3.1】										初始化栈
+template <class DT>
+void InitStack(SqStack<DT>& S, int m)
+{
+	S.base = new BTNode<DT>*[m];						// 申请栈空间
+	if (S.base == NULL)
+	{
+		cout << "未创建成功！";
+		exit(1);
+	}
+	S.top = -1;										// 空栈
+	S.stacksize = m;									// 栈容量为m
+}
+
+
+//算法3.2】											销毁栈
+template <class DT>
+void DestroyStack(SqStack<DT>& S)//析构函数
+{
+	delete[] S.base;								//释放栈空间
+	S.top = -1;
+	S.stacksize = 0;
+}
+
+
+//【算法3.3】
+template<class DT>
+bool Push(SqStack<DT>& S, BTNode<DT>* e)
+{
+	if (S.top == S.stacksize - 1)						// 栈满，不能插入
+		return false;
+	S.top++;
+	S.base[S.top] = e;
+	return true;									// 插入成功，返回true
+}
+
+//【算法3.4】										出栈
+template<class DT>
+bool Pop(SqStack<DT>& S, BTNode<DT>*& e)
+{
+	if (S.top == -1)									//栈空
+		return false;
+	e = S.base[S.top];
+	S.top--;
+	return true;									// 出栈成功，返回true
+}
+
+template<class DT>									// 获取栈元素
+bool GetTop(SqStack<DT>& S, BTNode<DT>*& e)
+{
+	if (S.top == -1)									// 栈空，返回false
+		return false;
+	e = S.base[S.top];								// 取栈元素
+	return true;									// 返回true
+}
+
+
+// 测栈空
+template<class DT>
+bool StackEmpty(SqStack<DT> S)
+{
+	if (S.top == -1)									// 栈空，返回true
+		return true;
+	else											// 栈非空，返回false
+		return false;
+}