二叉树遍历的c和java实现

#include<stdio.h>typedefintTelemType;
typedefstructBinaryTreeNode{
TelemTypedata;
structBinaryTreeNode*Left;
structBinaryTreeNode*Right;
}Node;
//创建二叉树，顺序依次为中间节点->左子树->右子树Node*createBinaryTree()
{
Node*p;
TelemTypech;
scanf("%d",&ch);
if(ch==0)     //如果到了叶子节点，接下来的左、右子树分别赋值为0    {
p=NULL;
    }
else    {
p= (Node*)malloc(sizeof(Node));
p->data=ch;
p->Left=createBinaryTree();  //递归创建左子树p->Right=createBinaryTree();  //递归创建右子树    }
returnp;
}
//先序遍历voidpreOrderTraverse(Node*root)
{
if( root )
    {
printf("%d ",root->data);
preOrderTraverse(root->Left);
preOrderTraverse(root->Right);
    }
}
//中序遍历voidinOrderTraverse(Node*root)
{
if( root )
    {
inOrderTraverse(root->Left);
printf("%d ",root->data);
inOrderTraverse(root->Right);
    }
}
//后序遍历voidlastOrderTraverse(Node*root)
{
if( root )
    {
lastOrderTraverse(root->Left);
lastOrderTraverse(root->Right);
printf("%d ",root->data);
    }
}
intmain()
{
Node*root=NULL;
root=createBinaryTree();
printf("二叉树建立成功");
printf("\n");
printf("前序遍历结果:\n");
preOrderTraverse(root);
printf("中序遍历结果:\n");
inOrderTraverse(root);
printf("后序遍历结果:\n");
lastOrderTraverse(root);
return0;
}