建立一个排序二叉树.docVIP

建立一个排序二叉树，并给出中序遍历该排序二叉树的结果 #include stdafx.h#includeiostreamusing namespace std;//-----------排序二叉树节点--------------//struct tree //定义二叉树节点结构{int data;?? //节点数据域tree *right,*left; //右，左子树指针}; //-----------排序二叉树类----------------//class Btree {tree *root;//根节点public:Btree(){?? root=NULL;//根节点在构造函数里初始化}void create_btree(int);//创建排序二叉树void display() //显示进行中序遍历排序后的数据{?? inorder(root);//调用中序遍历排序函数?? coutendl;}void inorder(tree *);//进行中序遍历排序}; void Btree::create_btree(int t){tree *newnode=new tree;//创建新的节点存入数据并插入二叉树中newnode-data =t;??????? //存入数据tnewnode-left =NULL;???? newnode-right =NULL;if(root==NULL) //当是根节点为空时即二叉树中没有任何数据时{?? root=newnode; //根节点为新节点}else???????? //当有二叉树中拥有数据后{?? tree *back; ?? tree *current;?? current=root; ??? while(current!=NULL) ?? {??? back=current; //记住current的父节点??????????? if(current-datat)???? current=current-left;??? else current=current-right ;?? }?? if(back-datat)??? back-left =newnode;?? else back-right =newnode;}}void Btree::inorder (tree* tmp)//采用递归进行中序遍历{if(tmp!=NULL){?? inorder(tmp-left);?? couttmp-data ;?? inorder(tmp-right );}} int main(int argc, char* argv[]){??? Btree A;int arr[]={7,4,1,5,12,8,13,11};cout建立排序二叉树顺序：endl;for(int i=0;i8;i++){?? coutarr[i] ;?? A.create_btree(arr[i]);}coutendl中序遍历序列:endl;A.display ();printf(Hello World!\n);return 0;} 将单链表拆分成一个偶数链表和奇数链表 程序如??： #include stdio.h #include stdlib.h typedef struct node { char data; struct node *nextPtr; }*LinkList, Lnode; static void CreateList(LinkList *headPtr, LinkList *tailPtr, char ch); static void Decompose(LinkList *headPtrA, LinkList *headPtrB, LinkList *tailPtrB); static void VisitList(LinkList headPtr); static void DestroyList(LinkList *headPtr, LinkList *tailPtr); int main(void) { LinkList headPtrA = NULL, tailPtrA = NULL, headPtrB = NULL, tailPtrB = NULL; char ch; while (1) { printf(Enter ch(@-quit): ); scanf( %c, ch); if (ch == @) { break; } else { CreateList(headPtrA, tailPtrA, ch); } } Visit