数据结构

完成函数将二叉树为ch1的字符替换为ch2。运行中输入的数据生成如下图所示的二叉树。

分数:

请勿频繁操作

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

typedef struct _Bitree
{
	char ch;
	struct _Bitree *lchild;
	struct _Bitree *rchild;
} Bitree;

void create(Bitree **t, char **str);
void preorder(Bitree *t);
void replace(Bitree *t, char origin, char destinate);

int main()
{
	char ch1, ch2, te;
	char *str;
	Bitree *t;

	str = (char *)malloc(100*sizeof(char));

	printf("Input tree:\n");
	fgets(str, 99, stdin);
	create(&t, &str);

	printf("Input ch1:");
	ch1 = getchar();
	while((te=getchar()) != '\n' && te != EOF)
	{
		;
	}
	printf("Input ch2:");
	ch2 = getchar();

	printf("before:");
	preorder(t);
	replace(t, ch1, ch2);
	printf("\nafter:");
	preorder(t);
	printf("\n");
	return 0;
}

void create(Bitree **t, char **str)
{
	//先根序递归创建二叉树
	//abc###d##，无左右孩子输入
	if (*str[0] == '#')
	{
		*t = NULL;
		return ;
	}
	
	*t = (Bitree *)malloc(sizeof(Bitree));
	(*t)->ch = *str[0];
	*str = *str + 1;
	create(&(*t)->lchild, str);
	*str = *str + 1;
	create(&(*t)->rchild, str);

}

void preorder(Bitree *t)
{
	if (t != NULL)
	{
		printf("%c", t->ch);
		preorder(t->lchild);
		preorder(t->rchild);
	}
}

/******start******/

/******end******/

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

typedef struct _Bitree
{
	char ch;
	struct _Bitree *lchild;
	struct _Bitree *rchild;
} Bitree;

void create(Bitree **t, char **str);
void preorder(Bitree *t);
void replace(Bitree *t, char origin, char destinate);

int main()
{
	char ch1, ch2, te;
	char *str;
	Bitree *t;

	str = (char *)malloc(100*sizeof(char));

	printf("Input tree:\n");
	fgets(str, 99, stdin);
	create(&t, &str);

	printf("Input ch1:");
	ch1 = getchar();
	while((te=getchar()) != '\n' && te != EOF)
	{
		;
	}
	printf("Input ch2:");
	ch2 = getchar();

	printf("before:");
	preorder(t);
	replace(t, ch1, ch2);
	printf("\nafter:");
	preorder(t);
	printf("\n");
	return 0;
}

void create(Bitree **t, char **str)
{
	//先根序递归创建二叉树
	//abc###d##，无左右孩子输入
	if (*str[0] == '#')
	{
		*t = NULL;
		return ;
	}
	
	*t = (Bitree *)malloc(sizeof(Bitree));
	(*t)->ch = *str[0];
	*str = *str + 1;
	create(&(*t)->lchild, str);
	*str = *str + 1;
	create(&(*t)->rchild, str);

}

void preorder(Bitree *t)
{
	if (t != NULL)
	{
		printf("%c", t->ch);
		preorder(t->lchild);
		preorder(t->rchild);
	}
}

/******start******/

/******end******/

完成函数统计二叉树中值为X的结点个数。

分数:

请勿频繁操作

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

typedef struct _Tree
{
	int data;
	struct _Tree *lchild;
	struct _Tree *rchild;
} Tree, *pTree;

int CreateBiTree(pTree *bt);
int countX(pTree bt, int x);

int main(void)
{
	int count;
	int x;
	pTree BT = NULL;

	printf("Input:\n");
	CreateBiTree(&BT);
	printf("Input X:\n");
	scanf("%d", &x);
	count = countX(BT, x);
	printf("countX = %d\n", count);
	return 0;
}

int CreateBiTree(pTree *bt)
{
	//先根序递归创建二叉树
	//1,2,3,0,0,0,4,0,0，无孩子时输入0值
	pTree p;
	int data;
	scanf("%d", &data);
	if (data != 0)
	{
		p = (pTree)malloc(sizeof(Tree));
		p->lchild = p->rchild = NULL;
		p->data = data;
		(*bt) = p;
		CreateBiTree(&p->lchild);
		CreateBiTree(&p->rchild);
	}
	return 0;
}

/******start******/

/******end******/

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

typedef struct _Tree
{
	int data;
	struct _Tree *lchild;
	struct _Tree *rchild;
} Tree, *pTree;

int CreateBiTree(pTree *bt);
int countX(pTree bt, int x);

int main(void)
{
	int count;
	int x;
	pTree BT = NULL;

	printf("Input:\n");
	CreateBiTree(&BT);
	printf("Input X:\n");
	scanf("%d", &x);
	count = countX(BT, x);
	printf("countX = %d\n", count);
	return 0;
}

int CreateBiTree(pTree *bt)
{
	//先根序递归创建二叉树
	//1,2,3,0,0,0,4,0,0，无孩子时输入0值
	pTree p;
	int data;
	scanf("%d", &data);
	if (data != 0)
	{
		p = (pTree)malloc(sizeof(Tree));
		p->lchild = p->rchild = NULL;
		p->data = data;
		(*bt) = p;
		CreateBiTree(&p->lchild);
		CreateBiTree(&p->rchild);
	}
	return 0;
}

/******start******/

/******end******/

完成函数统计二叉树的叶结点个数。运行中输入的数据生成如下图所示的二叉树。

分数:

请勿频繁操作

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

typedef struct _Tree
{
	int data;
	struct _Tree *lchild;
	struct _Tree *rchild;
} Tree, *pTree;

int CreateBiTree(pTree *bt);
int PreOrderTravBiTree(pTree bt);
int InOrderTravBiTree(pTree bt);
int PostOrderTravBiTree(pTree bt);
int countleaf(pTree bt);

int main(void)
{
	int count;
	pTree BT = NULL;

	printf("Input:\n");
	CreateBiTree(&BT);

	count = countleaf(BT);
	printf("countleaf = %d\n", count);
	return 0;
}

int CreateBiTree(pTree *bt)
{
	//先根序递归创建二叉树
	//1,2,3,0,0,0,4,0,0，无孩子时输入0值
	pTree p;
	int data;
	scanf("%d", &data);
	if (data != 0)
	{
		p = (pTree)malloc(sizeof(Tree));
		p->lchild = p->rchild = NULL;
		p->data = data;
		(*bt) = p;
		CreateBiTree(&p->lchild);
		CreateBiTree(&p->rchild);
	}
	return 0;
}

int PreOrderTravBiTree(pTree bt)
{
	if (bt != NULL)
	{
		printf("%d ", bt->data);
		PreOrderTravBiTree(bt->lchild);
		PreOrderTravBiTree(bt->rchild);
	}
	return 0;
}

int InOrderTravBiTree(pTree bt)
{
	if (bt != NULL)
	{
		InOrderTravBiTree(bt->lchild);
		printf("%d ", bt->data);
		InOrderTravBiTree(bt->rchild);
	}
	return 0;
}

int PostOrderTravBiTree(pTree bt)
{
	if (bt != NULL)
	{
		PostOrderTravBiTree(bt->lchild);
		PostOrderTravBiTree(bt->rchild);
		printf("%d ", bt->data);
	}
	return 0;
}

/******start******/

/******end******/

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

typedef struct _Tree
{
	int data;
	struct _Tree *lchild;
	struct _Tree *rchild;
} Tree, *pTree;

int CreateBiTree(pTree *bt);
int PreOrderTravBiTree(pTree bt);
int InOrderTravBiTree(pTree bt);
int PostOrderTravBiTree(pTree bt);
int countleaf(pTree bt);

int main(void)
{
	int count;
	pTree BT = NULL;

	printf("Input:\n");
	CreateBiTree(&BT);

	count = countleaf(BT);
	printf("countleaf = %d\n", count);
	return 0;
}

int CreateBiTree(pTree *bt)
{
	//先根序递归创建二叉树
	//1,2,3,0,0,0,4,0,0，无孩子时输入0值
	pTree p;
	int data;
	scanf("%d", &data);
	if (data != 0)
	{
		p = (pTree)malloc(sizeof(Tree));
		p->lchild = p->rchild = NULL;
		p->data = data;
		(*bt) = p;
		CreateBiTree(&p->lchild);
		CreateBiTree(&p->rchild);
	}
	return 0;
}

int PreOrderTravBiTree(pTree bt)
{
	if (bt != NULL)
	{
		printf("%d ", bt->data);
		PreOrderTravBiTree(bt->lchild);
		PreOrderTravBiTree(bt->rchild);
	}
	return 0;
}

int InOrderTravBiTree(pTree bt)
{
	if (bt != NULL)
	{
		InOrderTravBiTree(bt->lchild);
		printf("%d ", bt->data);
		InOrderTravBiTree(bt->rchild);
	}
	return 0;
}

int PostOrderTravBiTree(pTree bt)
{
	if (bt != NULL)
	{
		PostOrderTravBiTree(bt->lchild);
		PostOrderTravBiTree(bt->rchild);
		printf("%d ", bt->data);
	}
	return 0;
}

/******start******/

/******end******/

完成函数求二叉树的树高。运行中输入的数据生成如下图所示的二叉树。

分数:

请勿频繁操作

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

typedef struct _Tree
{
	int data;
	struct _Tree *lchild;
	struct _Tree *rchild;
} Tree, *pTree;

int CreateBiTree(pTree *bt);
int PreOrderTravBiTree(pTree bt);
int InOrderTravBiTree(pTree bt);
int PostOrderTravBiTree(pTree bt);
int height(pTree bt);

int main(void)
{
	int high;
	pTree BT = NULL;

	printf("Input:\n");
	CreateBiTree(&BT);
	/*
	PreOrderTravBiTree(BT);
	printf("\n");
	InOrderTravBiTree(BT);
	printf("\n");
	PostOrderTravBiTree(BT);
	printf("\n");
	*/
	high = height(BT);
	printf("high = %d\n", high);
	return 0;
}

int CreateBiTree(pTree *bt)
{
	//先根序递归创建二叉树
	//1,2,3,0,0,0,4,0,0，无孩子时输入0值
	pTree p;
	int data;
	scanf("%d", &data);
	if (data != 0)
	{
		p = (pTree)malloc(sizeof(Tree));
		p->lchild = p->rchild = NULL;
		p->data = data;
		(*bt) = p;
		CreateBiTree(&p->lchild);
		CreateBiTree(&p->rchild);
	}
	return 0;
}

int PreOrderTravBiTree(pTree bt)
{
	if (bt != NULL)
	{
		printf("%d ", bt->data);
		PreOrderTravBiTree(bt->lchild);
		PreOrderTravBiTree(bt->rchild);
	}
	return 0;
}

int InOrderTravBiTree(pTree bt)
{
	if (bt != NULL)
	{
		InOrderTravBiTree(bt->lchild);
		printf("%d ", bt->data);
		InOrderTravBiTree(bt->rchild);
	}
	return 0;
}

int PostOrderTravBiTree(pTree bt)
{
	if (bt != NULL)
	{
		PostOrderTravBiTree(bt->lchild);
		PostOrderTravBiTree(bt->rchild);
		printf("%d ", bt->data);
	}
	return 0;
}

/******start******/

/******end******/

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

typedef struct _Tree
{
	int data;
	struct _Tree *lchild;
	struct _Tree *rchild;
} Tree, *pTree;

int CreateBiTree(pTree *bt);
int PreOrderTravBiTree(pTree bt);
int InOrderTravBiTree(pTree bt);
int PostOrderTravBiTree(pTree bt);
int height(pTree bt);

int main(void)
{
	int high;
	pTree BT = NULL;

	printf("Input:\n");
	CreateBiTree(&BT);
	/*
	PreOrderTravBiTree(BT);
	printf("\n");
	InOrderTravBiTree(BT);
	printf("\n");
	PostOrderTravBiTree(BT);
	printf("\n");
	*/
	high = height(BT);
	printf("high = %d\n", high);
	return 0;
}

int CreateBiTree(pTree *bt)
{
	//先根序递归创建二叉树
	//1,2,3,0,0,0,4,0,0，无孩子时输入0值
	pTree p;
	int data;
	scanf("%d", &data);
	if (data != 0)
	{
		p = (pTree)malloc(sizeof(Tree));
		p->lchild = p->rchild = NULL;
		p->data = data;
		(*bt) = p;
		CreateBiTree(&p->lchild);
		CreateBiTree(&p->rchild);
	}
	return 0;
}

int PreOrderTravBiTree(pTree bt)
{
	if (bt != NULL)
	{
		printf("%d ", bt->data);
		PreOrderTravBiTree(bt->lchild);
		PreOrderTravBiTree(bt->rchild);
	}
	return 0;
}

int InOrderTravBiTree(pTree bt)
{
	if (bt != NULL)
	{
		InOrderTravBiTree(bt->lchild);
		printf("%d ", bt->data);
		InOrderTravBiTree(bt->rchild);
	}
	return 0;
}

int PostOrderTravBiTree(pTree bt)
{
	if (bt != NULL)
	{
		PostOrderTravBiTree(bt->lchild);
		PostOrderTravBiTree(bt->rchild);
		printf("%d ", bt->data);
	}
	return 0;
}

/******start******/

/******end******/