数据结构1 - 03-树3 Tree Traversals Again
摘要:
1 #include<stdio.h> 2 #define MAXN 31 3 int a[MAXN],n,flag[MAXN]; 4 void deal(); 5 int main(){ 6 scanf("%d",&n); 7 a[0] = n; 8 flag[0] = n; 9 deal(); 阅读全文
posted @ 2020-04-01 17:37 chenxi16 阅读(168) 评论(0) 推荐(0) 编辑