Question

Consider the partial implementation of a Binary Search Tree (BST) class. For simplicity, each Node stores only the key. Add a public member function to class BST that returns the largest absolute value in the tree.
The language is C++

#4 Coding [6 points] Consider the partial implementation of a Binary Search Tree (BST) class. For simplicity, each Node stores only the key. Add a public member function to class BST that returns the height of the tree. You may add private helper functions if that makes your solution easier. template <typename T> class Node T key; Node<T> +left, right, }; template <typename T> class BST U private: Node<T> root; public: Node<T> *Search(const T& Node<T> *cur = root; while (cur != nullptr) if (key == cur->key) return cur; // Found else if (key < cur->key) cur = cur->left; else cur = cur->right; return nullptr; // Not found unsigned int getHeight() { // YOUR CODE GOES HERE

Want the height

Answer 1

Code below gives the height of the bst tree.Replace the getHeight() function from this code.

#include <bits/stdc++.h>
using namespace std;
template < typename T>
class Node{
Node(T value): key(value), left(NULL), right(NULL) {}
T key ;
Node<T > *left,*right,*parent;
};
temdplate <typename T>
class BST{
private:
Node<T> root ;
public :
Node<T> *search(const T &key)
{
Node<T> *cur =root;
while(cur !=nullptr){
if(key == cur->key )
return cur;
else if(key <cur-> key )
cur=cur->left;
else
cur=cur->right;
  
return nullptr;
}
}
unsigned int getHeight(Node<T> root)
{
if (root == NULL)
return 0;
else
{

int lheight = getHeight(root->left);
int rheight = getHeight(root->right);
  
if (lheight > rheight)
return(lheight + 1);
else return(rheight + 1);
}
}

vid insert(Node< T> treeNode, int data)
{
if (!treeNode)
{
treeNode = new Node(data);   
_root = treeNode;   
}
else
{
if (data < treeNode->key)
{
if (!treeNode->left)
{
Node *treeTemp = new Node(data);
treeNode->left = treeTemp;
}
else
insert(treeNode->left, data);
}
else
{
if (!treeNode->right)
{
Node *treeTemp = new Node(data);   
treeNode->right = treeTemp;
}
else
insert(treeNode->right, data);
}
}
}
};
int main()
{
BST bst;
bst.insert(7);
bst.insert(9);
bst.insert(4);
bst.insert(1);
bst.insert(5);
cout<<getHeight(bst);
return 0;
}

output:

3