递归实现二叉查找树

最新推荐文章于 2024-02-04 17:18:07 发布
原创 最新推荐文章于 2024-02-04 17:18:07 发布 · 1.1k 阅读 · 0 ·
CC 4.0 BY-SA版权
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
文章标签：

#面试

一、头文件：

#ifndef _BIN_TREE_TEST_
#define _BIN_TREE_TEST_

struct treenode;
typedef struct treenode*  searchTree;
typedef int elementType;


searchTree MakeEmpty(searchTree t);
searchTree Find(elementType x,searchTree t);
searchTree FindMin(searchTree t);
searchTree FindMax(searchTree t);
searchTree Insert(elementType x,searchTree t);
searchTree Delete(elementType x,searchTree t);
elementType Retrieve(searchTree position);

void PrintElement_pre(searchTree t);
void PrintElement_mid(searchTree t);
void PrintElement_aft(searchTree t);


struct treenode
{
    elementType data;
    searchTree left;
    searchTree right;
};

#endif



二、C文件：

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


searchTree MakeEmpty(searchTree t)
{
    if(t)
    {
	MakeEmpty(t->left);
	MakeEmpty(t->right);
  	free(t);
    }

    return NULL;
}

searchTree Find(elementType x,searchTree t)
{
    if(t == NULL)
    	return NULL;
    if(x < t->data)
	return Find(x,t->left);
    else if(x > t->data)
	return Find(x,t->right);
    return t;
}

searchTree FindMin(searchTree t)
{
    if(t == NULL)
    	return NULL;
    else if(t->left == NULL)
	return t;
    else 
	return FindMin(t->left);
}

searchTree FindMax(searchTree t)
{
    if(t == NULL)
	return NULL;
    else if(t->right == NULL)
	return t;
    else 
	return FindMax(t->right);
}

searchTree Insert(elementType x,searchTree t)
{
    if(t == NULL)
    {
	t = (searchTree)malloc(sizeof(struct treenode));
	if(t == NULL)
	{
	    printf("alloca space error\n");
	    exit(-2);
	}

	t->data = x;
	t->left = NULL;
	t->right = NULL;
	//return t;
    }    

    else if(x < t->data)
    {
 	t->left = Insert(x,t->left);
 //	Insert(x,t->left);
    }
    else if(x > t->data)
    {
	t->right = Insert(x,t->right);
	//Insert(x,t->right);
    }
    return t;
}

searchTree Delete(elementType x,searchTree t)
{
    searchTree tmpnode = NULL;

    if(t == NULL)
	return NULL;
    else if(x < t->data)
	t->left = Delete(x,t->left);
    else if(x > t->data)
	t->right = Delete(x,t->right);
    else if(t->left && t->right)
    {	
	tmpnode = FindMin(t->right);
	t->data = tmpnode->data;
	t->right = Delete(tmpnode->data,tmpnode);
    }	
    else 
    {
	tmpnode = t;
       	if(t->right == NULL)
	    t = t->left;
	else if( t->left == NULL)
	    t = t->right;

	free(tmpnode);	
    }	

    return t;
}

elementType Retrieve(searchTree position)
{
    return position->data;
}



void PrintElement_pre(searchTree t)
{
    static int i = 0;
    if(t != NULL)
    {
	PrintElement_pre(t->left);
	printf("in pre,the %d element is %d\n",++i,t->data);
	PrintElement_pre(t->right);
    }
}


void PrintElement_mid(searchTree t)
{
    static int i = 0;
    if(t != NULL)
    {
	printf("int mid,the %d element is %d\n",++i,t->data);
	PrintElement_mid(t->left);
	PrintElement_mid(t->right);
    }
}

void PrintElement_aft(searchTree t)
{
    static int i = 0;
    if(NULL != t)
    {
	PrintElement_aft(t->left);
	PrintElement_aft(t->right);
	printf("in aft,the %d element is %d\n",++i,t->data);
    }
}

int main(int argc,char *argv[])
{
    searchTree t = NULL;
    searchTree position = NULL;
    static int first_insert = 1;
    //t = MakeEmpty(t);
    int i = 0;
    int x;
    int a[20] = {500,697,864,123,685,987,23,68,99,45,
		 66,456,568,999,1024,333,589,12,6,36};
    while(i < 20)
    {
	position = Insert(a[i],t);
	i++;
	if(first_insert)
	{
	    t = position;
	    first_insert = 0;
 	}
	printf("the insert address is %p\n",position);
	printf("the insert data is :%d\n",Retrieve(position));
    }

    printf("the t address is %p,the t->data is %d \n",t,t->data);

    printf("\n");    
    PrintElement_pre(t);
    printf("\n");    
    PrintElement_mid(t);
    printf("\n");    
    PrintElement_aft(t);
    printf("\n");    

    position = FindMin(t);
    printf("the min data is %d\n",position->data);
    position = FindMax(t);
    printf("the max data is %d\n",position->data);	

    i = 0;
    while( i < 20)
    {
        position = Delete(a[i],t);
	sleep(1);
	printf("the delete data is :%d\n",a[i]);
	printf("the position is %p\n",position);
	i++;
    }
    
}



三、打印输出：

the insert address is 0x80f3008
the insert data is :500
the insert address is 0x80f3008
the insert data is :500
the insert address is 0x80f3008
the insert data is :500
the insert address is 0x80f3008
the insert data is :500
the insert address is 0x80f3008
the insert data is :500
the insert address is 0x80f3008
the insert data is :500
the insert address is 0x80f3008
the insert data is :500
the insert address is 0x80f3008
the insert data is :500
the insert address is 0x80f3008
the insert data is :500
the insert address is 0x80f3008
the insert data is :500
the insert address is 0x80f3008
the insert data is :500
the insert address is 0x80f3008
the insert data is :500
the insert address is 0x80f3008
the insert data is :500
the insert address is 0x80f3008
the insert data is :500
the insert address is 0x80f3008
the insert data is :500
the insert address is 0x80f3008
the insert data is :500
the insert address is 0x80f3008
the insert data is :500
the insert address is 0x80f3008
the insert data is :500
the insert address is 0x80f3008
the insert data is :500
the insert address is 0x80f3008
the insert data is :500
the t address is 0x80f3008,the t->data is 500 

in pre,the 1 element is 6
in pre,the 2 element is 12
in pre,the 3 element is 23
in pre,the 4 element is 36
in pre,the 5 element is 45
in pre,the 6 element is 66
in pre,the 7 element is 68
in pre,the 8 element is 99
in pre,the 9 element is 123
in pre,the 10 element is 333
in pre,the 11 element is 456
in pre,the 12 element is 500
in pre,the 13 element is 568
in pre,the 14 element is 589
in pre,the 15 element is 685
in pre,the 16 element is 697
in pre,the 17 element is 864
in pre,the 18 element is 987
in pre,the 19 element is 999
in pre,the 20 element is 1024

int mid,the 1 element is 500
int mid,the 2 element is 123
int mid,the 3 element is 23
int mid,the 4 element is 12
int mid,the 5 element is 6
int mid,the 6 element is 68
int mid,the 7 element is 45
int mid,the 8 element is 36
int mid,the 9 element is 66
int mid,the 10 element is 99
int mid,the 11 element is 456
int mid,the 12 element is 333
int mid,the 13 element is 697
int mid,the 14 element is 685
int mid,the 15 element is 568
int mid,the 16 element is 589
int mid,the 17 element is 864
int mid,the 18 element is 987
int mid,the 19 element is 999
int mid,the 20 element is 1024

in aft,the 1 element is 6
in aft,the 2 element is 12
in aft,the 3 element is 36
in aft,the 4 element is 66
in aft,the 5 element is 45
in aft,the 6 element is 99
in aft,the 7 element is 68
in aft,the 8 element is 23
in aft,the 9 element is 333
in aft,the 10 element is 456
in aft,the 11 element is 123
in aft,the 12 element is 589
in aft,the 13 element is 568
in aft,the 14 element is 685
in aft,the 15 element is 1024
in aft,the 16 element is 999
in aft,the 17 element is 987
in aft,the 18 element is 864
in aft,the 19 element is 697
in aft,the 20 element is 500

the min data is 6
the max data is 1024
the delete data is :500
the position is 0x80f3008
the delete data is :697
the position is 0x80f3008
the delete data is :864
the position is 0x80f3008
the delete data is :123
the position is 0x80f3008
the delete data is :685
the position is 0x80f3008
the delete data is :987
the position is 0x80f3008
the delete data is :23
the position is 0x80f3008
the delete data is :68
the position is 0x80f3008
the delete data is :99
the position is 0x80f3008
the delete data is :45
the position is 0x80f3008
the delete data is :66
the position is 0x80f3008
the delete data is :456
the position is 0x80f3008
the delete data is :568
the position is 0x80f3008
the delete data is :999
the position is 0x80f3008
the delete data is :1024
the position is 0x80f3008
the delete data is :333
the position is 0x80f3008
the delete data is :589
the position is 0x80f3068
the delete data is :12
the position is 0x80f3008
the delete data is :6
the position is 0x80f3008
the delete data is :36
the position is 0x80f3008


二叉搜索树的相关操作（递归实现）
谢广涛的博客
05-17 1877
本文章主要介绍二叉搜索树的概念以及递归实现二叉搜索树的相关操作：按值插入、按值查找、按值删除。
搜索二叉树递归操作
Hanani_Jia的博客
05-08 1721
 之前给大家介绍了搜索二叉树的非递归算法，今天给大家介绍一些搜索二叉树的递归算法的操作。  这里主要介绍的是插入，查找和删除。其实插入和之前的二叉树的操作是一样的，不过依然是需要判断你要查入的元素应当插入的位置。int BSTreeInsertR(BSTreeNode** tree, DataType x) { if (*tree == NULL) { *tree = BuyBSTreeN...
二叉树递归套路（2）：判断二叉树是否是搜索二叉树、二叉树的最大距离
Java和算法学习的博客
01-03 794
文章目录一、判断二叉树是否是搜索二叉树1、经典做法2、递归套路思路3、递归套路代码二、二叉树的最大距离1、递归套路思路2、递归套路代码 本篇继续来聊聊二叉树的递归套路。 一、判断二叉树是否是搜索二叉树 搜索二叉树定义：二叉树中的任意一个以X为头的子树，左子树都比X小，右子树都比X大。（经典的搜索二叉树是没有重复值的） 1、经典做法 中序遍历，结果是递增的，说明这是搜索二叉树。 2、递归套路思路 分析任意一个以X为头的子树，满足以X为头的子树是搜索二叉树的条件（列出所有可能性） 1）左子树是搜索二叉树 2）右
C语言经典算法之二叉树查找（递归实现）
weixin_56154577的博客
02-03 1555
在C语言中，二叉查找树（BST, Binary Search Tree）的查找算法可以通过递归方式实现。
数据结构(一)二叉搜索树-递归实现
weixin_30480651的博客
03-24 135
二叉搜索树(BinarySearchTree)的定义 T是一颗空树 如果TL不为空，则TL.key <= root.key 如果TR不为空，则有TR.key >= root.key TL、TR同时也是一颗二叉搜索树 TL、TR分别代表左右子树，root代表根,key是关键字 实现代码 ...
二叉查找树 减治法——C++代码
05-24
在二叉查找树的应用中，减治法通常用于递归地处理树的结构，例如在搜索、插入和删除操作中，我们首先比较目标值与当前节点的键，然后根据比较结果决定是在左子树还是右子树继续操作。 在C++中实现二叉查找树，一般...
JS实现二叉查找树的建立以及一些遍历方法实现
10-20
本文将详细探讨如何使用JavaScript来实现二叉查找树的构建以及遍历方法的实现。 ### 二叉查找树的节点与结构 首先，二叉查找树由一系列节点组成，每个节点包含三个要素：数据域、左子节点引用和右子节点引用。数据...
c++实现二叉查找树示例
09-04
在C++中实现二叉查找树，我们需要定义两个类，一个是数据节点`dNode`，另一个是二叉树节点`bstNode`，以及一个用于操作二叉查找树的类`bst`。 首先，数据节点`dNode`包含了三个成员变量：`name`表示姓名，`age`表示...
数据结构---非递归实现二叉排序树
啦~啦~啦~的博客
03-10 2200
非递归实现二叉排序树 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;二叉树的定义就是根据递归来定义的，所以用递归实现比较简单，非递归就相对来说比较复杂。 &nbsp;&nbsp; &nbsp;下面就说一说搜索二叉树的非递归操作。 &nbsp;&nbsp; &nbsp; void SearchTreeInsert(SearchTreeNode **r...
数据结构---递归实现二叉排序树
啦~啦~啦~的博客
03-10 3854
二叉排序树的实现 二叉排序树（简称BST）又称二叉查找（搜索）树，其定义为：二叉排序树或者是空树或者是满足如下性质的二叉树： 1.若它的左子树不为空，则左子树上所有的结点的值都小于根结点的值 2.若它的右子树不为空，则右子树上的所有节点的值都大于跟结点 的值 3.它的左右子树也分别为二叉搜索树 二叉排序树还有一...
递归实现二叉搜索树建立
TRQYC的博客
05-14 470
写了个代码，然而就是运行崩溃，各种调试半天，发现还是不知道哪里错了 不抱希望的百度了下，发现网上竟然有典型错我与我的代码一样，唉。转载如下 #include #include #include typedef struct NODE { NODE * pleft; NODE * pright; int ivalue; } node; /* 错误示例，实际上这
二叉搜索树（递归）
t617的博客
05-15 507
二叉排序树也叫二叉搜索树和二叉查找树，是比较常见的一种二叉树 下面是二叉树的简单递归建立与遍历和删除操作方法： #include using namespace std; class binary { private: struct node { int data; node* l; node* r; node(i
c++模板类递归实现二叉搜索树及其基本操作
ssopp24的博客
04-06 550
二叉树搜索概念：http://baike.baidu.com/link?url=RK7ax6iDk2wiEzUxjKBfyOTcYKLgaDuAcyih0a6qjAewfYeK9PoIhWzjdSZl7ylwhkOdx-6ZCFhGuF0aIG1phG-X2sc9QP8KFWavC95c-ocAL9cs71wZhCOHVHsdRs3Ugr1Z85Iycv1zosbpZiRHea
二叉搜索树的递归形式
xiaodu655的博客
01-25 231
二叉树的非递归在上篇博客中已经写过了，现在来看递归形式。 #includeiostream> #includeassert.h> using namespace std; templateclass k, class v> struct BSTreeNode { BSTreeNode(const k&key, const v&value) :_pLeft(NULL)
数据结构与算法--二叉搜索树2(递归)
weixin_63894681的博客
10-13 830
一、修剪二叉搜索树 二、将有序数组转换为二叉搜索树 三、把二叉搜索树转成累加树
二叉搜索树（递归和非递归分别实现）
qingcunsuiyue的博客
10-21 405
这是在上一篇博客的基础上进行完善。 1.插入的递归 bool InsertR(const T& key) { return _InsertR(_root,key); } bool _InsertR(Node*& root,const T& key) { if(root==NULL) { root=new Node(key); return true; }
【C++】二叉搜索树的实现（递归和非递归实现）
Ahaooooooo的博客
02-16 1025
模拟实现BSTree
「递归算法」：验证二叉搜索树
最新发布
C_Small_Cai的博客
02-04 539
二叉树的例题，我们都得先判断这棵树是否为空树，也就是 root 是否为 null ，是的话返回 true 即可，因为这也是符合题目要求的一颗二叉搜索树。按照中序遍历，接下来依次轮到根节点和右子树了，先定义一个 cur 节点来判断根节点是否大于其左子树的值，是的话返回 true ，反之亦然。注意这里可以做一个优化：定义一个布尔类型变量，用于接受我们刚刚的递归调用，如果返回的是 false ，那就证明他。这里有一个小细节， “左子树的值” 我在开始的时候定义成了全局变量，省去了每一次递归都要传值的繁琐。
二叉树的递归套路——搜索二叉树
Harrison的学习博客
12-15 772
给定一棵二叉树的头节点head,返回这颗二叉树是不是搜索二叉树 搜索二叉树定义：左树所有结点比头结点小，右树所有结点比头结点大，每颗子树都如此。 根据二叉树的递归套路，直接得出每颗子树需要返回的信息就是： 整颗子树是否是搜索二叉树 整颗子树的最大值 整颗子树的最小值 比较简单，如果有不了解可以看看这篇文章——二叉树的递归套路——最大二叉搜索子树 接下来直接看代码叭： package com.harrison.class08; import java.util.ArrayList; public cl
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值