//建立二叉链表 输入数据并进行遍历
#include<stdio.h>
#include<stdlib.h>
#include<malloc.h>
typedef struct Node
{
    char data;
    struct Node *Lchild;
    struct Node *Rchild;
}BiTree;                 //  BiTree 相当于struct Node *      即BiTree x==struct Node *
   //输入二叉链表并存储
 void  precreat(BiTree *tree)
 {
     BiTree *t;
     char ch;
     t=tree;
     ch=getchar();
     if(ch='#')
         t=NULL;
     else
     {
         t=(BiTree*)malloc(sizeof(BiTree));
         t->data=ch;
         precreat(t->Lchild);
         precreat(t->Rchild);
     }
 }
 //先序遍历二叉树
  void PreOrder(BiTree *root)
  {
      if(root)
      {
              printf("%c",root->data);
            PreOrder(root->Lchild);
            PreOrder(root->Rchild);
      }
  }
  void main()
  {
      BiTree *tree;
      precreat(tree);
      PreOrder(tree);
  }