1.写出折半查找的递归算法的递归算法
代码描述:
typedef struct {
int a[10] = { 0,1,2,3,4,5,6,7,8,9 };
int length=9;
}ST;
int Bin(ST s, int ans, int low, int high) {
int mid = (high + low) / 2;
if (low > high) return 0;
else
{
if (ans > s.a[mid]) return Bin(s, ans, mid + 1, high);
else if (ans < s.a[mid]) return Bin(s, ans, low, mid - 1);
else return mid;
}
}
int main() {
ST s;
printf("%d", Bin(s, 10, 1, 9));
}
2.中序遍历二叉树是否是二叉排序树
代码描述:
#include"stdio.h"
#include <corecrt_malloc.h>
typedef struct treenode {
char data;
struct treenode* lchild, * rchild;
}treenode, * tree;
//建树操作
void buildtree(tree& t) {
char ch;
ch=getchar();
if (ch == '#') t = NULL;
else
{
t = (treenode*)malloc(sizeof(treenode));
t->data = ch;
t->lchild = NULL;
t->rchild = NULL;
buildtree(t->lchild);
buildtree(t->rchild);
}
}
//中序遍历二叉树是否是二叉排序树
//初始化 前驱节点
int pre = -999999;
int isok(tree t) {
if (t == NULL) return 1;
else
{
//中序遍历
int b1 = isok(t->lchild);//判断左子树
if (b1 == 0 || pre >= t->data) return 0;//判断左子树是否为
pre = t->data;//保留前驱节点值
int b2 = isok(t->rchild);
return b2;
}
}
int main() {
tree t;
buildtree(t);
printf("%d", isok(t));
return 0;
}
运行结果:
3.设计一个算法,求出指定结点在给定二叉排序树中的层次。
代码描述:
#include"stdio.h"
#include <corecrt_malloc.h>
typedef struct treenode {
char data;
struct treenode* lchild, * rchild;
}treenode, * tree;
//建树操作
void buildtree(tree& t) {
char ch;
ch=getchar();
if (ch == '#') t = NULL;
else
{
t = (treenode*)malloc(sizeof(treenode));
t->data = ch;
t->lchild = NULL;
t->rchild = NULL;
buildtree(t->lchild);
buildtree(t->rchild);
}
}
//设计一个算法,求出指定结点在给定二叉排序树中的层次。
int level(tree t, treenode* p) {
int high = 0;//初始化高度
treenode* tt = t;
if (t != NULL)
{
high++;//高度增加
while (tt->data!=p->data){
if (tt->data > p->data) {
tt = tt->lchild;
high++;
}
else
{
tt = tt->rchild;
high++;
}
}
}
return high;
}
int main() {
tree t;
buildtree(t);
printf("%d", level(t, t->lchild->lchild));
return 0;
}
运行截图:
4.利用二叉树遍历的思想编写一个判断二叉树是否是平衡二叉树的算法。
运行代码:
#include"stdio.h"
#include <stdlib.h>
#include <corecrt_malloc.h>
typedef struct treenode {
char data;
struct treenode* lchild, * rchild;
}treenode, * tree;
//建树操作
void buildtree(tree& t) {
char ch;
ch=getchar();
if (ch == '#') t = NULL;
else
{
t = (treenode*)malloc(sizeof(treenode));
t->data = ch;
t->lchild = NULL;
t->rchild = NULL;
buildtree(t->lchild);
buildtree(t->rchild);
}
}
//判断二叉排序树是否是二叉平衡树的算法
int high(tree t) {
int lh, rh,max;//左右子树高度
if (t == NULL) {
return 0;
}
else
{
lh = high(t->lchild);
rh = high(t->rchild);
max = (lh > rh) ? lh : rh;
return max + 1;
}
}
bool isAVL(tree t) {
if (!t) return 1;
if (abs(high(t->lchild) - high(t->rchild)) > 1) return 0;
return isAVL(t->lchild) && isAVL(t->rchild);
}
int main() {
tree t;
buildtree(t);
printf("%d",isAVL(t));
return 0;
}
运行代码:
5.设计一个算法,从大到小输出二叉排序树中所有值不小于k的关键字。
代码描述:
#include"stdio.h"
#include <stdlib.h>
#include <corecrt_malloc.h>
typedef struct treenode {
char data;
struct treenode* lchild, * rchild;
}treenode, * tree;
//建树操作
void buildtree(tree& t) {
char ch;
ch=getchar();
if (ch == '#') t = NULL;
else
{
t = (treenode*)malloc(sizeof(treenode));
t->data = ch;
t->lchild = NULL;
t->rchild = NULL;
buildtree(t->lchild);
buildtree(t->rchild);
}
}
//输出关键字>=k的节点
void search_k(tree t,char k) {
if (t == NULL) return;
else
{
//中序遍历二叉排序树
if (t->lchild != NULL) search_k(t->lchild, k);
if (t->data >= k) printf("%c", t->data);
if (t->rchild != NULL) search_k(t->rchild, k);
}
}
int main() {
tree t;
buildtree(t);
search_k(t, 'E');
return 0;
}
运行结果展示: