蓝色守望

摘要： #include <stdio.h>int Pation(int ch[],int begin,int end);void Sort(int ch[],int begin,int end){ if(begin<end){ int mid=Pation(ch,begin,end); Sort(ch,begin,mid-1); Sort(ch,mid+1,end); }}int Pation(int ch[],int begin,int end){ int tmp=ch[end]; int i=begin-1; int j=b... 阅读全文

摘要： typedef int ElemType;typedef struct Binary_Tree{ ElemType value; int bf ; struct Binary_Tree *lchild,*rchild;}Tree;void InsertTree(Tree **t,ElemType e){ Tree *node; node=*t; if(!node){ node=(Tree *)malloc(sizeof(Tree)); node->value=e; node->lchild=NULL; node->rchild=NULL; *t=node; } else i. 阅读全文