BST C语言实现

(5条消息) 数据结构：线性表(List)【详解】_UniqueUnit的博客-CSDN博客 

线性表顺序存储结构

顺序表 

#include<stdio.h>
#include<stdlib.h>

/*定义节点的结构体*/
typedef struct node {
	int data;
	struct node* left;
	struct node* right;
}Node;

/*定义树的结构体，root指向根节点*/
typedef struct tree {
	Node* root;
}Tree;

/*插入：先为新节点分配空间。再判断是否存在根节点。再进入循环，判断值大小，再判断对应子节点是否存在*/
void insert(Tree* tree, int value) {
	Node* node = (Node*)malloc(sizeof(Node));
	node->data = value;
	node->left = NULL;
	node->right = NULL;
	if (tree->root == NULL) {
			tree->root = node;
		}
	else {
		Node* temp = tree->root;

		while (temp != NULL) {
			if (temp->data > value) {
				if (temp->left == NULL) {
					temp->left = node;
					return;
				}
				else {
					temp = temp->left;
				}
			}
			else {
				if (temp->right == NULL) {
					temp->right = node;
					return;
				}
				else {
					temp = temp->right;
				}

			}
		}
	}
	
	
	
}

/*三种遍历*/
void preorder(Node* node) {
	if (node != NULL) {
		printf("%d ", node->data);
		preorder(node->left);
		preorder(node->right);
	}

}

void miorder(Node* node) {
	if (node != NULL) {
		miorder(node->left);
		printf("%d ", node->data);
		miorder(node->right);
	}
}

void postorder(Node* node) {
	if (node != NULL) {
		postorder(node->left);
		postorder(node->right);
		printf("%d ", node->data);
	}
}

int get_height(Node* node) {
	if (node == NULL) {
		return 0;
	}
	else {
		int h_left = get_height(node->left);
		int h_right = get_height(node->right);

		int max = h_left;
		if (h_left < h_right)
			max = h_right;
		return max + 1;
	}
}

/*直接向两侧找最值*/
void min(Node* node) {
	while (node->left != 0) {
		node = node->left;
	}
	printf("%d", node->data);
}

void max(Node* node) {
	while (node->right != 0) {
		node = node->right;
	}
	printf("%d", node->data);
}

/*通过与左右树比较找最值(默认数值都是正数)*/
int find_max(Node* node) {
	if (node == 0)
		return -1;
	else {
		int m1 = find_max(node->left);
		int m2 = find_max(node->right);
		int m3 = node->data;

		int max = m3;
		if (m1 > max)
			max = m1;
		if (m2 > max)
			max = m2;
		return max;
	}

}


int main() {
	int arr[] = { 2,7,6,4,5,1,3,8,9 };
	Tree tree;
	tree.root = NULL;

	int i;
	for (i = 0; i < sizeof(arr) / sizeof(arr[0]); i++) {
		insert(&tree, arr[i]);
	}

	preorder(tree.root);
	printf("\n");
	miorder(tree.root);
	printf("\n");
	postorder(tree.root);

	int h = get_height(tree.root);
	printf("\n%d", h);

	printf("\n");
	min(tree.root);
	printf("\n");
	max(tree.root);

	printf("\n");
	int mm = find_max(tree.root);
	printf("%d", mm);
}

线性表链式存储结构

单链表 

#include<stdio.h>
#include<stdlib.h>

#define ok 1
#define error 0
typedef int status;//函数类型
typedef int elemtype;//节点内数据的类型
int len;//本程序只能运行一个链表，长度设为全局变量

typedef struct node{
	elemtype data;
	struct node* next;
}Node;//节点结构

status initlist(Node* head_s) {
	head_s->next = NULL;
	len = 0;
	return ok;
}//生成头节点。已经定义过空间了，直接指向NULL。如果声明空间后再赋值，值不会保留下来。

status insert(Node* head_s, int i, int val) {
	if (i<1 || i>len + 1)
		return error;
	Node* p = (Node*)malloc(sizeof(Node));
	if (p == NULL)
		return error;
	p->data = val;

	Node* q = head_s;
	for (int k = 1; k < i; k++)
		q = q->next;
	p->next = q->next;
	q->next = p;

	len++;
	return ok;
}//插入。判断输入的数字是否在范围内，创建空间，加入数值，新建指针指向目标节点的前续节点，再插入，长度加一。

status delet(Node* head,int i) {
	if (i<1 || i>len )
		return error;
	Node* p=head, * q;
	for (int k = 1; k < i; k++)
		p = p->next;
	q = p->next;
	p->next = q->next;
	free(q);
	
	len--;
	return ok;
}//删除。判断数字是否在范围内，两个节点分别指向节点和前续节点，释放空间，长度减一。

void show(Node* head_s) {
	Node* p = head_s->next;
	for (int i = 1; i <= len; i++) {
		printf("%d ", p->data);
		p = p->next;
	}
	printf("\n");
}//顺序打印数据。

status clear(Node* head) {
	Node* p = head->next, * q;
	while (p->next) {
		q = p;
		p = p->next;
		free(q);
	}
	free(p);
	/*for (int i = 1; i <= len; i++) {
		q = p;
		p = p->next;
		free(q);
	}*/
	len = 0;
	return ok;
}//清空链表。

status destory(Node* head) {
	Node* p = head->next;
	Node* q = p;
	while (p != NULL) {
		p = p->next;
		free(q);
		q = p;
	}
	len = 0;
	free(head);
	return ok;
}//销毁链表。头节点也释放。

int main() {
	Node head;
	initlist(&head); printf("长度为%d\n", len);
	for (int i = 1; i <= 10; i++) {
		insert(&head, i, i);
	}
	//int arr[10] = { 2,7,4,6,11,3,4,9,3,567 };
	//for (int i = 1; i <= 10; i++) {
	//	insert(&head, i, arr[i-1]);//在用数组插入时要注意数组是从0开始的。
	//}
	//show(&head); printf("长度为%d\n", len);
	//insert(&head, 5, 99);
	//show(&head); printf("长度为%d\n", len);
	//delet(&head, 5);
	//show(&head); printf("长度为%d\n", len);
	//clear(&head);
	show(&head); printf("长度为%d\n", len);
	//destory(&head);
}

静态链表