上海交大数据结构机考技巧个人总结.docx

《上海交大数据结构机考技巧个人总结.docx》由会员上传分享，免费在线阅读，更多相关内容在应用文档-天天文库。

1、#includeusingnamespacestd;intdata[10000];intmain(){//栈inttop=0;//入栈：data[top++]=x;//出站：y=data[--top];//判空top==0;//队列：intq[100000],head=0,tail=0;/入队写q[tail++]=a;//出队写a=q[head++];//队非空条件是headsize)r

2、eturn;//超过了二叉树的存储cout<size)return;midorder(root*2);cout<size)return;postorder(root*2);postorder(root*2+1);cout<

3、有很大的内存浪费的问题！structnode{node*left;node*right;/////////intx;inty;////////node():{left=NULL;right=NULL;}node(intnum,node*a,node*b){data=num;left=a;}}node*root=NULL;//空二叉树//二叉堆inta[10]={3,1,5,4,2,9,8,7,6};for(inti=size/2;i>=1;i--)percodown(a,i,10);voidpercodown(inta[],inthole,i

4、ntsize){inttmp=a[hole];intchild;for(;hole*2<=size;){chile=hole*2;if(child!=size&&a[child+1]

5、ructvernode{intver;edgenode*head;};vernode*verlist=newvernode[7];//快速排序inta[10]={3,1,5,4,2,9,8,7,6};voidquickssort(inta[],intlow,inthigh){intmid;if(low>=high)return;mid=div(a,low,high);quicksort(a,low,mid-1);quicksort(a,mid+1,high);}intdiv(inta[],intlow,inthigh){inttmp=a[lo

6、w];do{while(low=tmp}--high;if(lowusingnamespacestd;constintN=7;intdata[N][N]={0,1,1,0,0,0,0,0,0,0,1,1,1,

7、0,0,0,0,0,1,0,1,0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,0,0,1,0,0,0,0,0,0,0,0,0,0};intmain(){intindegree[N]={0};for(inti=0;i

8、indegree[j]==0)break;}//找到度为0的点cout<