数据结构算法阅读题目.docVIP

第一题 void PurgeItem(LinkList list) { LinkList p, q = list; p = list-next; while (p != NULL) { if (p-data == item) { q-next = p-next; free(p); p = q-next; } else? { q = p; p = p-next; } } if (list-data == item) { q = list; list = list-next; free(q); } } 第二题. void Reverse(LinkList list) { LinkList p, q, r; p = list; q = NULL; while (p != NULL) { r = q; q = p; p = p-next; q-next = r; } list = q;} 第三题 LinkList Copy(LinkList lista){ LinkList listb; if (lista == NULL) return NULL; else { listb = (LinkList)malloc(sizeof(LNode)); listb-data = lista-data; listb-next = Copy(lista-next); return listb; }} 第四题 LinkList MergeList(LinkList lista, LinkList listb) { LinkList listc, p = lista, q = listb, r; if (lista-data = listb-data) { listc = lista; r = lista; p = lista-next; } else { listc = listb; r = listb; q = listb-next; } while (p != NULL q != NULL) { if (p-data = q-data) { r-next = p; r = p; p = p-next; } else { r-next = q; r = q; q = q-next; } } r-next = (p != NULL) ? p : q; return listc; } 第五题 #define MAX_STACK 50void PreOrderTraverse(BTree T){ BTree STACK[MAX_STACK], p = T; int top = -1; while (p != NULL || top != -1) { while (p != NULL) { VISIT(p); STACK[++top] = p; p = p-lchild; } p = STACK[top--]; p = p-rchild; }} 第六题 #define MAX_QUEUE 50void LayeredOrderTraverse(BTree T){ BTree QUEUE[MAX_QUEUE], p; int front, rear; if (T != NULL) { QUEUE[0] = T; front = -1; rear = 0; while (front rear) { p = QUEUE[++front]; VISIT(P);if (p-lchild != NULL) QUEUE[++rear] = p-lchild; if (p-rchild != NULL) QUEUE[++rear] = p-rchild; } }} 第七题int Depth(BTree T){ int ldepth, rdepth; if (T == NULL) return 0; else { ldepth = Depth(T-lchild); rdepth = Depth(T-rchild); if (ldepth rdepth) return ldepth+1; else return rdepth+1; }} 第八题 int BinSearch(int A[], int n, int key) { int low=0, hi