void preTreverse(struct BTree *T)//前序遍历
{
if(T)
{
printf("%d ",T->data);
preTreverse(T->left);
preTreverse(T->right);
}
}
void inTreverse(struct BTree *T)//中序遍历
{
if(T)
{
inTreverse(T->left);
printf("%d ",T->data);
inTreverse(T->right);
}
}
void postTreverse(struct BTree *T)//后序遍历
{
if(T)
{
postTreverse(T->left);
postTreverse(T->right);
printf("%d ",T->data);
}
}
二叉树前序、中序、后序递归遍历实现(C语言)
最新推荐文章于 2024-05-15 11:44:20 发布