launchcore/Data_Structure
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

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

Browse Source
This commit is contained in:
綾瀬桃桃
2025-11-06 09:43:54 +08:00
parent 5dbdfef1a1
commit e01c041259
232 changed files with 22806 additions and 1256 deletions
Download Patch File Download Diff File Expand all files Collapse all files

53
Experiment/Experiment3/LeafNum.cpp Normal file
View File

@@ -0,0 +1,53 @@
#include <iostream>
#include "BiTree.h"
using namespace std;
//递归方法求解二叉树叶节点个数
template <class DT>
int LeafNum_1(BTNode<DT>* bt) {
if (!bt) {
return 0;
}
else if (bt->lchild == NULL && bt->rchild == NULL) {
return 1;
}
else {
return LeafNum_1(bt->lchild) + LeafNum_1(bt->rchild);
}
}
//非递归方法求解二叉树叶节点个数
template <class DT>
int LeafNum_2(BTNode<DT>* bt) {
if (!bt)
return 0;
SqStack<DT> S;
InitStack(S, 20);
BTNode<DT>* p = bt;
int count = 0;
while (p != NULL || !StackEmpty(S))
{
while (p != NULL)
{
if (p->lchild == NULL && p->rchild == NULL)
count++;
Push(S, p);
p = p->lchild;
}
if (!StackEmpty(S))
{
Pop(S, p);
p = p->rchild;
}
}
return count;
}
int main() {
BTNode<char>* bt;
CreateBiTree(bt);
cout << "递归方法求得二叉树叶节点个数为：" << LeafNum_1(bt) << endl;
cout << "非递归方法求得二叉树叶节点个数为：" << LeafNum_2(bt) << endl;
DestroyBiTree(bt);
return 0;
}

31
Experiment/Experiment3/LeafNum.sln Normal file
View File

@@ -0,0 +1,31 @@
Microsoft Visual Studio Solution File, Format Version 12.00
# Visual Studio Version 17
VisualStudioVersion = 17.10.34928.147
MinimumVisualStudioVersion = 10.0.40219.1
Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "LeafNum", "LeafNum.vcxproj", "{A1435839-D838-4C8A-8F43-03AE8436D845}"
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
{A1435839-D838-4C8A-8F43-03AE8436D845}.Debug|x64.ActiveCfg = Debug|x64
{A1435839-D838-4C8A-8F43-03AE8436D845}.Debug|x64.Build.0 = Debug|x64
{A1435839-D838-4C8A-8F43-03AE8436D845}.Debug|x86.ActiveCfg = Debug|Win32
{A1435839-D838-4C8A-8F43-03AE8436D845}.Debug|x86.Build.0 = Debug|Win32
{A1435839-D838-4C8A-8F43-03AE8436D845}.Release|x64.ActiveCfg = Release|x64
{A1435839-D838-4C8A-8F43-03AE8436D845}.Release|x64.Build.0 = Release|x64
{A1435839-D838-4C8A-8F43-03AE8436D845}.Release|x86.ActiveCfg = Release|Win32
{A1435839-D838-4C8A-8F43-03AE8436D845}.Release|x86.Build.0 = Release|Win32
EndGlobalSection
GlobalSection(SolutionProperties) = preSolution
HideSolutionNode = FALSE
EndGlobalSection
GlobalSection(ExtensibilityGlobals) = postSolution
SolutionGuid = {C6AC6B0D-CC6B-4023-9F49-D0756F2B0732}
EndGlobalSection
EndGlobal

138
Experiment/Experiment3/LeafNum.vcxproj Normal file
View File

@@ -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>{a1435839-d838-4c8a-8f43-03ae8436d845}</ProjectGuid>
<RootNamespace>LeafNum</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>true</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>
<ClInclude Include="bitree.h" />
</ItemGroup>
<ItemGroup>
<ClCompile Include="LeafNum.cpp" />
</ItemGroup>
<Import Project="$(VCTargetsPath)\Microsoft.Cpp.targets" />
<ImportGroup Label="ExtensionTargets">
</ImportGroup>
</Project>

27
Experiment/Experiment3/LeafNum.vcxproj.filters Normal file
View File

@@ -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>
<ClInclude Include="bitree.h">
<Filter>头文件</Filter>
</ClInclude>
</ItemGroup>
<ItemGroup>
<ClCompile Include="LeafNum.cpp">
<Filter>源文件</Filter>
</ClCompile>
</ItemGroup>
</Project>

BIN
Experiment/Experiment3/Report.docx Normal file
View File

Binary file not shown.

424
Experiment/Experiment3/bitree.h Normal file
View File

@@ -0,0 +1,424 @@
#include <iostream>
using namespace std;
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>
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;
}