06 2019 档案

二叉树先序存储广义表输出
摘要：#include #include #define maxSize 50 typedef struct Node{ int data[maxSize]; int n; }Sqbtree; void createSqbtree(Sqbtree &L,char pre[],int n, int &S){ char ch =pre[S++]; if(ch == ';... 阅读全文
posted @ 2019-06-03 23:24 LeeGdong 阅读(377) 评论(0) 推荐(0)