提交图的最短路径

2017-1/Micylt/hw8/BSTOutput.txt

@@ -0,0 +1,11 @@
+8, 3, 1, 6, 4, 5, 7, 10, 14, 19, 22, 30
+
+8, 3, 1, 6, 4, 5, 7, 10, 14, 13, 19, 22, 30
+
+7, 3, 1, 6, 4, 5, 10, 14, 13, 19, 22, 30
+
+7, 3, 1, 6, 4, 10, 14, 13, 19, 22, 30
+
+7, 3, 1, 6, 4, 10, 14, 13, 19, 22, 20, 30
+
+7, 3, 1, 4, 10, 14, 13, 19, 22, 20, 30

2017-1/Micylt/hw8/BSTree.c

@@ -0,0 +1,130 @@
+#include"BSTree.h"
+int max = 0;
+
+bool EQ(KeyType kval, KeyType data) {
+	if (kval == data) {
+		return true;
+	}
+	else {
+		return false;
+	}
+}
+
+bool LT(KeyType kval, KeyType data) {
+	if (kval != data && kval < data) {
+		return true;
+	}
+	else {
+		return false;
+	}
+}
+
+Status preOrderTraverse(BiTree T) {
+	if (T) {
+		printf("%d", T->data);
+		if (T->data != max) {
+			printf(", ");
+		}
+		preOrderTraverse(T->lchild);
+		preOrderTraverse(T->rchild);
+		return OK;
+	}
+	else {
+		return ERROR;
+	}
+}
+
+bool SearchBST(BiTree T, KeyType kval, BiTree f, BiTree *p) {
+	if (!T) {
+		*p = f;
+		return false;
+	}
+	else if (EQ(kval, T->data)) {
+		*p = T;
+		return true;
+	}
+	else if (LT(kval, T->data)) {
+		return SearchBST(T->lchild, kval, T, p);
+	}
+	else {
+		return SearchBST(T->rchild, kval, T, p);
+	}
+}
+
+bool InsertBST(BiTree *T, KeyType e, BiTree p) {
+	BiTree s = NULL;
+	if (max < e) 
+{
+		max = e;
+	}
+	if (!(s = (BiTNode *)malloc(sizeof(BiTNode)))) {
+		exit(OVERFLOW);
+	}
+	if (!(p = (BiTNode *)malloc(sizeof(BiTNode)))) {
+		exit(OVERFLOW);
+	}
+	if (!SearchBST(*T, e, NULL, &p)) {
+		s->data = e;
+		s->lchild = s->rchild = NULL;
+		if (!p) {
+			*T = s;
+		}
+		else if (LT(e, p->data)) {
+			p->lchild = s;
+		}
+		else {
+			p->rchild = s;
+		}
+		return true;
+	}
+	else {
+		return false;
+	}
+}
+
+Status Delete(BiTree *p) {
+	BiTree q = NULL;
+	BiTree s = NULL;
+	if (!(*p)->rchild) {
+		q = *p;
+		(*p) = (*p)->lchild;
+	}
+	else if (!(*p)->lchild) {
+		q = *p;
+		(*p) = (*p)->rchild;
+	}
+	else {
+		q = *p;
+		s = (*p)->lchild;
+		while (s->rchild) {
+			q = s;
+			s = s->rchild;
+		}
+		(*p)->data = s->data;
+		if (q != (*p)) {
+			q->rchild = s->lchild;
+		}
+		else {
+			q->rchild = s->lchild;
+		}
+	}
+	return OK;
+}
+
+bool DeleteBST(BiTree *T, KeyType kval) {
+	if (!T) {
+		return false;
+	}
+	else {
+		if (EQ(kval, (*T)->data)) {
+			Delete(T);
+			return true;
+		}
+		else if (LT(kval, (*T)->data)) {
+			return DeleteBST(&(*T)->lchild, kval);
+		}
+		else {
+			return DeleteBST(&(*T)->rchild, kval);
+		}
+	}
+}

2017-1/Micylt/hw8/BSTree.h

@@ -0,0 +1,28 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+typedef int KeyType;
+
+typedef enum 
+{
+	false,
+	true,
+}bool;
+typedef enum {
+	OK,
+	OVERFLOW,
+	ERROR,
+} Status;
+typedef struct BiTNode 
+{
+	int data;
+	struct BiTNode *lchild, *rchild;
+}BiTNode, *BiTree;
+
+bool EQ(KeyType kval, KeyType data);
+bool LT(KeyType kval, KeyType data);
+Status preOrderTraverse(BiTree T);
+bool SearchBST(BiTree T, KeyType kval, BiTree f, BiTree *p);
+bool InsertBST(BiTree *T, KeyType e, BiTree p);
+Status Delete(BiTree *p);
+bool DeleteBST(BiTree *T, KeyType kval);

2017-1/Micylt/hw8/main1.c

@@ -0,0 +1,32 @@
+#include"BSTree.h"
+
+int main() {
+	char c[30] = { 8, 10, 14, 3, 1, 6, 4, 7, 5, 19, 22, 30 };
+	char c1[10] = { 13, 8, 5, 20, 6 };
+	int i;
+	bool flag = 0;
+	BiTree T = NULL;
+	BiTree p = NULL;
+
+	for (i = 0; i<12; i++) 
+	{
+		InsertBST(&T, c[i], p);
+	}
+
+	preOrderTraverse(T);
+	printf("\n\n");
+
+	for (i = 0; i<5; i++)  //5����������ij���
+	{
+		flag = SearchBST(T, c1[i], NULL, &p);
+		if (flag == true) {
+			DeleteBST(&T, c1[i]);
+		}
+		else {
+			InsertBST(&T, c1[i], p);
+		}
+		preOrderTraverse(T);
+		printf("\n\n");
+	}
+	return 0;
+}