二叉树
摘要：
第一次有点理解，写了个二叉树#include<stdio.h>#include<stdlib.h>typedef struct Node{ char ch; struct Node *lc,*rc;}node,*Link;void Create( Link *L ){ char ch; while( scanf( "%c",&ch ),ch == ' ' || ch == '\n' ); if( ch == '#' ) *L = NULL; else { ( *L ) = new node; ( 阅读全文
posted @ 2011-06-10 18:31 LeeBlog 阅读(254) 评论(0) 推荐(0) 编辑