算法导论习题15.5-1解答

最新推荐文章于 2021-03-07 20:53:39 发布

原创最新推荐文章于 2021-03-07 20:53:39 发布 · 1.3k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#算法 #branch #include

算法导论专栏收录该内容

1 篇文章

订阅专栏

本文介绍了一个使用C++实现的构建最优二叉搜索树的方法。通过递归地构造左子树和右子树，该算法能够根据预定义的根节点数组来输出最优二叉搜索树的结构。此算法适用于理解最优二叉搜索树的概念及其构建过程。

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

#include "stdafx.h"
#include <iostream>
const int DimensionOfRoot=6;
void construct_optimal_BST(int root[][DimensionOfRoot],int i,int j)
{
 int sr=0;
 sr=root[i][j];
 if(1==i && DimensionOfRoot-1==j)//this is a root node
  std::cout<<"k"<<sr<<" is the root"<<std::endl;
 if(i>sr-1) //process the left branch of the leaf
  std::cout<<"d"<<sr-1<<" is the left child of k"<<sr<<std::endl;
 else //not a leaf node,to add the left subtree
 {
  std::cout<<"k"<<root[i][sr-1]<<" is the left child of k"<<sr<<std::endl;
  construct_optimal_BST(root,i,sr-1);
 }
 if(sr+1>j) //process the right branch of the leaf
  std::cout<<"d"<<sr<<" is the right child of k"<<sr<<std::endl;
 else //not a leaf node,to add the right subtree
 {
  std::cout<<"k"<<root[sr+1][j]<<" is the right child of k"<<sr<<std::endl;
  construct_optimal_BST(root,sr+1,j);
 }
}
int _tmain(int argc, _TCHAR* argv[])
{
 int root[DimensionOfRoot][DimensionOfRoot]={{0,0,0,0,0,0},
            {0,1,1,2,2,2},
            {0,0,2,2,2,4},
            {0,0,0,3,4,5},
            {0,0,0,0,4,5},
            {0,0,0,0,0,5}};
 construct_optimal_BST(root,1,DimensionOfRoot-1);
 return 1;
}