数据结构实验-二叉树基本操作-C语言实现

#include <iostream>
#include <stdlib.h>
using namespace std;
typedef struct node
{
   
	char sh;
	struct node *lchild, *rchild;
}TreeNode, *pTreeNode;

//这里注意，必须要使用&，不然后面求二叉树深度时有误
void Creat_Tree(pTreeNode & T)
{
   
	char ch;
	cin >> ch;
	if (ch == '#')
		T = NULL;
	else
	{
   
		T = new TreeNode;
		T->sh = ch;
		Creat_Tree(T->lchild);
		Creat_Tree(T->rchild);
	}
}
void Before_Search(pTreeNode T)
{
   
	//二叉树先序遍历
	if (T)
	{
   
		cout << T->sh;
		Before_Search(T->lchild);
		Before_Search(T->rchild);
	}
}
void Medium_Search(pTreeNode T)
{
   
	//二叉树中序遍历
	if (T)
	{
   
		Medium_Search(T->lchild);
		cout << T->sh;
		Medium_Search(T->rchild);
	}
}
void Last_Search(pTreeNode T)