C++一些基本算法代码.docx

2010年11月29号开始实习#includeiostreamusing namespace std;struct node{int data;node *next;};void main(){node *p1,*p2,*p3,*p4,*p5,*p;p1=new node();p2=new node();p3=new node();p4=new node();p5=new node();p1-data=1;p2-data=2;p3-data=3;p4-data=4;p5-data=5;p1-next=p2;p2-next=p3;p3-next=p4;p4-next=p5;p5-next=NULL;coutp1-data:p1-dataendl;coutp2-data:p2-dataendl;coutp3-data:p3-dataendl;coutp4-data:p4-dataendl;coutp5-data:p5-dataendl;coutp2=p3endl;p2=p3;coutp2-data:p2-dataendl;coutp1-next-data:p1-next-dataendl;coutp1-next-next-data:p1-next-next-dataendl; //指针与指针之间的指向是按内存地址的指向来寻址的，与指针变量之间没//有太大的联系}文档2（平衡二叉树）#includeiostream.h#includestdlib.h#includestring.h#includestdio.h#define EQ(a,b) ((a)==(b))#define LT(a,b) ((a)(b))#define LQ(a,b) ((a)(b))#define LH+1#define EH0#define RH-1typedef int KeyType;typedef struct{int key; //关键字域}ElemType;typedef struct BSTNode{ ElemType data; int bf; //结点的平衡因子 struct BSTNode *lchild,*rchild; //左右孩子指针}BSTNode,*BSTree;void InitBSTree(BSTree T){T=NULL;}void R_Rotate(BSTree p){ BSTNode *lc; lc=p-lchild; //lc指向的*p的左子树根结点 p-lchild=lc-rchild; //lc的右子树挂接为*p的左子树 lc-rchild=p; p=lc; //p指新的得根结点}//R_Rotatevoid L_Rotate(BSTree p){ BSTNode *rc; rc=p-rchild; //lc指向的*p的右子树根结点 p-rchild=rc-lchild; //lc的左子树挂接为*p的右子树 rc-lchild=p; p=rc; //p指新的根结点}//L_Rotatevoid LeftBalance(BSTree T){ BSTNode *lc,*rd; lc=T-lchild; switch(lc-bf) { case LH: T-bf=lc-bf=EH; R_Rotate(T); break; case RH: rd=lc-rchild; switch(rd-bf) { case LH: T-bf=RH; lc-bf=EH; break; case EH: T-bf=lc-bf=EH; break; case RH: T-bf=EH; lc-bf=LH; break; }//switch(rd-bf) rd-bf=EH; L_Rotate(T-lchild); R_Rotate(T); }//switch(lc-bf)}//LeftBalancevoid RightBalance(BSTree T){ BSTNode *lc,*ld; lc=T-rchild; switch(lc-bf) { case LH: ld=lc-lchild; switch(ld-bf) { case LH: T-bf=EH; lc-bf=RH; break; case EH: T-bf=lc-bf=EH; break; case RH: T-bf=LH; lc-bf=EH; break; }//switch(rd-bf) ld-bf=EH; R_Rotate(T-rchild); L_Rotate(T); case RH: T-bf=lc-bf=EH; L_Rotate(T)