Compute the height of a binary search tree

最新推荐文章于 2022-04-11 22:32:09 发布

nemoyy

最新推荐文章于 2022-04-11 22:32:09 发布

阅读量524

点赞数

本文链接：https://blog.youkuaiyun.com/nemoyy/article/details/53740806

版权

本文介绍了一种通过给定整数列表构建二叉搜索树的方法，并计算该树的高度。采用递归方式插入节点，确保每个节点的左子树的所有节点值小于该节点值，右子树的所有节点值大于该节点值。最后通过递归函数计算树的高度。

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

Given a list of integers, we can build a binary search tree by inserting them one by one, then compute the height. The input has two lines: the first line is an integer n, the second line contains n integers, for example,

5 3 9

The output is the height of the binary search tree in one line. In this case, the output is

#include <iostream>
#include <stack>
#include <vector>
#include <algorithm>


using namespace std;


typedef int T;
struct BinaryNode{
  T data;
  BinaryNode *left, *right;
  BinaryNode(T d, BinaryNode *l=NULL, BinaryNode* r=NULL):data(d), left(l), right(r) {};
};

int height(BinaryNode* root){
    int leftheight,rightheight;
    if(root==NULL) return -1;
    else{
        leftheight = height(root->left);
        rightheight = height(root->right);
        return (leftheight>rightheight)? (leftheight+1) : (rightheight+1);

    }

} 

void recursive_insert(BinaryNode* &p, int data){
	if(p == NULL){
		p = new BinaryNode(data);
	}
	else if(data < p->data){
		recursive_insert(p->left,data);
	}
	else if(data > p->data){
		recursive_insert(p->right,data);
	}
}

void BST_insert(BinaryNode* &root,int data){
	recursive_insert(root, data);
}

int main(){
	int n;cin>>n;
	//vector<int> v; 
	int t;	
	BinaryNode* root = NULL;
	for (int i = 0; i < n; ++i)
	{
		cin>>t;
		BST_insert(root,t);
	}
	
	
	cout<<height(root)<<endl;

}