遍历
//递归遍历
//先序
void recursion_dlr(binarynode* root)
{
if (root==NULL)
{
return;
}
//遍历根节点
cout<<root->ch<<"\t";
//遍历左子树
recursion_dlr(root->lchild);
//遍历右子树
recursion_dlr(root->rchild);
}
//中序
void recursion_ldr(binarynode* root)
{
if (root==NULL)
{
return;
}
//遍历左子树
recursion_ldr(root->lchild);
//遍历根节点
cout<<root->ch<<"\t";
//遍历右子树
recursion_ldr(root->rchild);
}
//后序
void recursion_lrd(binarynode* root)
{
if (root==NULL)
{
return;
}
//遍历左子树
recursion_lrd(root->lchild);
//遍历右子树
recursion_lrd(root->rchild);
//遍历根节点
cout<<root->ch<<"\t";
}
定义二叉树节点
//定义二叉树节点
class binarynode
{
public:
char ch; //节点数据域
binarynode* lchild; //左孩子
binarynode* rchild; //右孩子
};
创建二叉树
//创建二叉树
void createtree()
{
//创建节点
binarynode node1={'A',NULL,NULL};
binarynode node2={'B',NULL,NULL};
binarynode node3={'C',NULL,NULL};
binarynode node4={'D',NULL,NULL};
binarynode node5={'E',NULL,NULL};
binarynode node6={'F',NULL,NULL};
binarynode node7={'G',NULL,NULL};
binarynode node8={'H',NULL,NULL};
//建立节点关系
node1.lchild=&node2;
node1.rchild=&node6;
node2.rchild=&node3;
node3.lchild=&node4;
node3.rchild=&node5;
node6.rchild=&node7;
node7.lchild=&node8;
cout<<"先序遍历:"<<endl;
recursion_dlr(&node1);
cout<<endl;
cout<<"中序遍历:"<<endl;
recursion_ldr(&node1);
cout<<endl;
cout<<"后序遍历:"<<endl;
recursion_lrd(&node1);
cout<<endl;
}
遍历结果
int main()
{
createtree();
system("pause");
return 0;
}