基於二叉鏈表的二叉樹的遍歷

#include<bits/stdc++.h> using namespace std; typedef struct node { char data; struct node *lc,*rc; } node,*link; int i,flag; void creat(link &L) { char ch; scanf("%c",&ch); i++;

>>阅读原文<<