BinaryTree的构建和遍历,以及搜索删除(非完全二叉树,非平衡二叉树)

#include<iostream>
using namespace std;
typedef struct Tree//树基本结构体
{
int data;
struct Tree* Lnode;
struct Tree* Rnode;
}*TREE;
void CreateBinaryTree(TREE & tree, int data)//二分搜索树
{
bool a = true;
TREE NewNode, CurrentNode, ParentNode = NULL;
CurrentNode = tree;
while (CurrentNode)
{
ParentNode = CurrentNode;
if (CurrentNode->data <= data)
CurrentNode = CurrentNode->Rnode;
else
CurrentNode = CurrentNode->Lnode;
}
if (!ParentNode)
{
NewNode = new Tree;
NewNode->data = data;
NewNode->Lnode = NULL;
NewNode->Rnode = NULL;
tree = NewNode;
}
else
{
NewNode = new Tree;
NewNode->data = data;
NewNode->Lnode = NULL;
NewNode->Rnode = NULL;
if (data < ParentNode->data)
ParentNode->Lnode = NewNode;
else
ParentNode->Rnode = NewNode;
}
}
void TraverseTree(Tree* tree, char h)
{
if (tree)
{
switch (h)
{
case 1://前序遍历
printf("%d  ", tree->data, h);
TraverseTree(tree->Lnode, h);
TraverseTree(tree->Rnode, h);
break;
case 2://中序遍历
TraverseTree(tree->Lnode, h);
printf("%d  ", tree->data, h);
TraverseTree(tree->Rnode, h);
break;
case 3://后序遍历
TraverseTree(tree->Lnode, h);
TraverseTree(tree->Rnode, h);
printf("%d  ", tree->data, h);
break;
}
}
}
void RomoveNode(Tree* & tree)//删除节点
{
if (!tree->Lnode)
{
Tree*p = tree;
tree = p->Rnode;
delete p;
}
if (!tree->Rnode)
{
Tree*p = tree;
tree = p->Lnode;
delete p;
}
else
{
Tree* CurrentNode = tree;
Tree* Temp = CurrentNode;
Temp = Temp->Lnode;
while (Temp->Rnode)
{
CurrentNode = Temp;
Temp = Temp->Rnode;
}
tree->data = Temp->data;
if (CurrentNode == tree)
{
CurrentNode->Lnode = Temp->Lnode;
}
else
CurrentNode->Rnode = Temp->Lnode;
delete Temp;
}
}
void SearchNode(Tree* & tree, int  data)
{
if (tree)
{
if (tree->data == data)
RomoveNode(tree);
if (tree->data > data)
SearchNode(tree->Lnode,data);
else if (tree->data < data)
SearchNode(tree->Rnode,data);
}
}


int main()
{
Tree* tree = NULL;
int arr[] = { 1, 45, 4, 25, 15, 68, 898, 55, 75, 9, 8, 12, 64, 42, 88, 795, 67 };
for (int i = 0; i < 17; ++i)
CreateBinaryTree(tree, arr[i]);
TraverseTree(tree, 2);//中序遍历
cout << endl;
SearchNode(tree, 25);
TraverseTree(tree, 2);//中序遍历
cout << endl;
system("pause");
return 0;
}