用先序法輸入樹的結點，輸出它的先中後三種序列

#include<stdio.h> #include<stdlib.h> typedef struct node {char a; struct node *zuo,*you; }node,*link;//結點 void jianli(link *p) {char c; c=getchar(); if(c==' ') *p=0; else {*p=(node*)malloc(sizeof(no

>>阅读原文<<