408/Wangdao-Data-Structures
1
1
Fork 0
mirror of https://github.com/Ruvikm/Wangdao-Data-Structures.git synced 2026-10-28 19:05:35 +08:00
Code Issues Projects Releases Wiki Activity

改题号

Browse Source
This commit is contained in:
Ruvikm
2021-02-09 10:57:04 +08:00
parent 89a01da716
commit 61482755bc
3 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
树与二叉树/树与二叉树的应用/P196.10.cpp
View File

@@ -91,7 +91,7 @@ void FindX(BST_Tree T, ElemType X, Node*& r) {
#pragma endregion
//P195.10
//P196.10
//设计一个算法,从大到小输出二叉排序树中所有值不小于k的关键字
void NotLessThan_K(BST_Tree T, int k) {

2
树与二叉树/树与二叉树的应用/P196.12.cpp
View File

@@ -100,7 +100,7 @@ void FindX(BST_Tree T, ElemType X, Node*& r) {
#pragma endregion
//P195.12
//P196.12
//编写一个递归算法,在一棵有n个结点的、随机建立起来的二叉排序树上查找第k(1≤
//≤n)小的元素, 并返回指向该结点的指针。要求算法的平均时间复杂度为O(log2n)
//二叉排序树的每个结点中除data, lchild, child等数据成员外, 增加一个 count

2
树与二叉树/树与二叉树的应用/P196.9.cpp
View File

@@ -91,7 +91,7 @@ void FindX(BST_Tree T, ElemType X, Node*& r) {
#pragma endregion
//P195.9
//P196.9
//设计一个算法,求出给定二叉排序树中最小和最大的关键字
void BestValue(BST_Tree T,int &min,int &max) {