二叉搜索树的建立
二叉树的前序遍历,中序遍历,后序遍历。
求树的高度,求最大值
上代码:
#include <stdio.h>
#include <malloc.h>
/********定义结点结构体*********/
typedef struct node {
int data;
struct node* lchild;
struct node* rchild;
}Node;
/********定义树的结构体********/
typedef struct {
Node* root;
}Tree;
/*******建立二叉搜索树********/
/********比根节点小的数放进左子树,比根结点大的数放进右子树******/
void insert(Tree *tree,int value) {
Node *node = malloc(sizeof(Node));
node->data = value;
node->lchild = NULL;
node->rchild = NULL;
if (tree->root == NULL) //如果树的根节点为空,就把结点放到根节点上
tree->root = node;
else {
Node *temp = tree->root; //否则,弄一个temp等于根节点,当前的数值就跟temp比较
while (temp != NULL) //while循环,如果temp不为空
{
if (value < temp->data) {
if (temp->lchild == NULL) {
temp->lchild = node; //如果temp的左结点为空,就把结点插到左边
return;
}
else {
temp = temp->lchild; //如果不为空,就把temp移到temp的左结点处进行比较
}
}
else {
if (temp->rchild == NULL) {
temp->rchild = node;
return;
}
else {
temp = temp->rchild;
}
}
}
}
}
/***********前序遍历**********/
void preorder(Node *node)
{
if (node != NULL) {
printf("%d ", node->data);
preorder(node->lchild);
preorder(node->rchild);
}
}
/************中序遍历********/
void inorder(Node *node)
{
if (node != NULL) {
preorder(node->lchild);
printf("%d ", node->data);
preorder(node->rchild);
}
}
/************后序遍历********/
void postorder(Node *node)
{
if (node != NULL) {
preorder(node->lchild);
preorder(node->rchild);
printf("%d ", node->data);
}
}
/************求树的高度*********/
int get_height(Node *node)
{
if (node == NULL)
return 0;
else
{
int left_height = get_height(node->lchild); //左子树的高度,用递归
int right_height = get_height(node->rchild);
int max = left_height;
if (right_height> max)
max = right_height;
return max + 1;
}
}
/***********求最大值************/
int get_maxnum(Node *node)
{
if (node == NULL)
return -1;
else {
int m1 = get_maxnum(node->lchild);
int m2 = get_maxnum(node->rchild);
int m3 = node->data;
int max = m1;
if (m2 > max)
max = m2;
if (m3 > max)
max = m3;
return max;
}
}
int main()
{
int arr[7] = {1,3,0,2,5,10,8};
Tree tree;
tree.root = NULL;
int i;
for (i = 0; i < 7; i++) {
insert(&tree, arr[i]);
}
printf("前序遍历结果:");
preorder(tree.root);
printf("\n中序遍历结果:");
inorder(tree.root);
printf("\n后序遍历结果:");
postorder(tree.root);
int tree_height=get_height(tree.root);
printf("\n树的高度为%d:", tree_height);
int maxnum = get_maxnum(tree.root);
printf("\n最大值为:%d", maxnum);
system("pause");
}
结果如下: