二叉树删除具有两个子节点

最新推荐文章于 2022-01-02 22:50:35 发布

qq789045

最新推荐文章于 2022-01-02 22:50:35 发布

阅读量1.7k

点赞数 3

分类专栏：数据结构与算法分析——c语言描述答案

本文链接：https://blog.csdn.net/qq789045/article/details/51218336

版权

数据结构与算法分析——c语言描述答案专栏收录该内容

111 篇文章 115 订阅

订阅专栏

本文探讨了数据结构与算法分析中关于C语言描述的二叉树操作，重点在于如何正确删除拥有两个子节点的元素。通过实例a、b、c详细解析了这一过程。

摘要由CSDN通过智能技术生成

数据结构与算法分析——c语言描述练习4.13 答案

else if (cursorSpace[t].left && cursorSpace[t].right) {
		/*
		tempCell = findMin(cursorSpace[t].right);
		cursorSpace[t].element = cursorSpace[tempCell].element;
		cursorSpace[t].right = Delete(cursorSpace[t].element, cursorSpace[t].right);
		*/

		tempCell = findMax(cursorSpace[t].left);
		cursorSpace[t].element = cursorSpace[tempCell].element;
		cursorSpace[t].left = Delete(cursorSpace[t].element, cursorSpace[t].left);
	}

SearchTree Delete(ElementType X, SearchTree t) {
	static int wayToDelete;
	Position tempCell;
	if (t == 0) {
		Error("Element not found");
	}
	else if (X < cursorSpace[t].element)
		cursorSpace[t].left = Delete(X, cursorSpace[t].left);
	else if (X > cursorSpace[t].element)
		cursorSpace[t].right = Delete(X, cursorSpace[t].right);
	else if (cursorSpace[t].left && cursorSpace[t].right) {
		if (wayToDelete) {
			wayToDelete = 0;
			tempCell = findMin(cursorSpace[t].right);
			cursorSpace[t].element = cursorSpace[tempCell].element;
			cursorSpace[t].right = Delete(cursorSpace[t].element, cursorSpace[t].right);

		}
		else {
			wayToDelete = 1;
			tempCell = findMax(cursorSpace[t].left);
			cursorSpace[t].element = cursorSpace[tempCell].element;
			cursorSpace[t].left = Delete(cursorSpace[t].element, cursorSpace[t].left);
		}
	}
	else {
		tempCell = t;
		if (cursorSpace[t].left == 0)
			t = cursorSpace[t].right;
		else if (cursorSpace[t].right == 0)
			t = cursorSpace[t].left;
		cursorDispose(tempCell);
	}
	return t;
}

#include<stdlib.h>
SearchTree Delete(ElementType X, SearchTree t) {
	Position tempCell;
	if (t == 0) {
		Error("Element not found");
	}
	else if (X < cursorSpace[t].element)
		cursorSpace[t].left = Delete(X, cursorSpace[t].left);
	else if (X > cursorSpace[t].element)
		cursorSpace[t].right = Delete(X, cursorSpace[t].right);
	else if (cursorSpace[t].left && cursorSpace[t].right) {
		if (rand()%2) {
			tempCell = findMin(cursorSpace[t].right);
			cursorSpace[t].element = cursorSpace[tempCell].element;
			cursorSpace[t].right = Delete(cursorSpace[t].element, cursorSpace[t].right);

		}
		else {
			tempCell = findMax(cursorSpace[t].left);
			cursorSpace[t].element = cursorSpace[tempCell].element;
			cursorSpace[t].left = Delete(cursorSpace[t].element, cursorSpace[t].left);
		}
	}
	else {
		tempCell = t;
		if (cursorSpace[t].left == 0)
			t = cursorSpace[t].right;
		else if (cursorSpace[t].right == 0)
			t = cursorSpace[t].left;
		cursorDispose(tempCell);
	}
	return t;
}