二叉排序树

最新推荐文章于 2024-12-08 08:30:00 发布

云治

最新推荐文章于 2024-12-08 08:30:00 发布

阅读量106

点赞数

CC 4.0 BY-SA版权

分类专栏：数据结构

本文链接：https://blog.youkuaiyun.com/m0_37896011/article/details/99692812

数据结构专栏收录该内容

64 篇文章

订阅专栏

本文详细介绍了二叉搜索树的基本操作实现，包括判断是否为二叉搜索树、查找、插入和删除节点等功能，通过队列遍历和递归方式实现了高效的操作流程。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

bool is_bstree(treenode * root)
	{
		if (root == NULL)
		{
			return true;
		}
		queue<treenode * > q;
		q.push(root);
		while (!q.empty())
		{
			root = q.front();
			q.pop();
			if (root->left != NULL)
			{
				if (root->left->val < root->val)
				{
					q.push(root->left);
				}
				else
					return false;
			}
			if (root->right != NULL)
			{
				if (root->right->val>root->val)
				{
					q.push(root->right);
				}
				else
					return false;
			}
		}
		return true;
	}

	bool find_bstree(treenode *root,int key)
	{
		if (root == NULL)
			return false;
		if (root->val == key)
			return true;
		if (key > root->val)
			return find_bstree(root->right, key);
		if (key < root->val)
			return find_bstree(root->left, key);
	}
	bool nice_find_bstree(treenode *root, int key)
	{
		if (root == NULL)
			return false;
		queue<treenode *> q;
		q.push(root);
		while (!q.empty())
		{
			root = q.front();
			q.pop();
			if (root->val == key)
				return true;
			if (key > root->val)
			{
				if (root->right)
					q.push(root->right);
			}
			if (key < root->val)
			{
				if (root->left)
					q.push(root->left);
			}

		}
		return false;
	}
	void  insert_bstree(treenode *root, int key)
	{
		if (root == NULL)
		{
			root = new treenode(key);
			return;
		}
		queue<treenode *> q;
		q.push(root);
		while (!q.empty())
		{
			root = q.front();
			q.pop();
			if (root->val == key)
				return ;//有就不插
			if (key > root->val)
			{
				if (root->right)
					q.push(root->right);
				else
				{
					root->right = new treenode(key);
					return;
				}
			}
			if (key < root->val)
			{
				if (root->left)
					q.push(root->left);
				else
				{
					root->left = new treenode(key);
					return;
				}
			}
		}		
	}

	bool  delete_bstree(treenode *root, int key)
	{
		if (root == NULL)
			return false;
		treenode *par = root;
		treenode *p = root;
		while (p != NULL)
		{
			if (p->val == key)
			{
				if (p->left == NULL &&p->right == NULL)
				{
					if (par->left == p)
						par->left = NULL;
					else if (par->right == p)
						par->right = NULL;
					delete p;
				}
				else if (p->left == NULL)
				{
					if (par->left == p)
					{
						par->left = p->right;
					}
					else
					{
						par->right = p->right;
					}
					delete p;
				}
				else if (p->right == NULL)
				{
					if (par->left == p)
					{
						par->left = p->left;
					}
					else
					{
						par->right = p->left;
					}
					delete p;
				}
				else//找左子树 最右边的结点  或者 右子树  最左边的结点
				{
					treenode*q = p->left;
					par = p;
					while (q->right != NULL)
					{
						par = q;
						q = q->right;
					}
					p->val = q->val;
					//删除q
					if (q->left != NULL)//q是 否左子树为空
					{
						if (par->left == q)
						{
							par->left = q->left;
						}
						else
						{
							par->right = q->left;
						}
						delete q;
					}
					else//q 是叶子结点
					{
						if (par->left == q)
							par->left = NULL;
						else if (par->right == q)
							par->right = NULL;
						delete q;
					}
				}
				return true;
			}
			if (p->val > key)
			{
				par = p;
				p = p->left;
			}
			else if (p->val < key)
			{
				par = p;
				p = p->right;
			}
		}
		return false;
	}