二叉链表的基本操做

#include<iostream> using namespace std; struct node { node *lChild; node *rChild; char data; }; //先序递归建立树 node *createTree() { char ch; cin>>ch; node *root; if(ch=='#')

>>阅读原文<<