Question

C++

(b) Consider a binary search tree of positive integers without duplicates. Implement (write out) a program to find the second greatest element in the tree. The Second function is a member function of class BinarySearchTree. The function returns zero if the tree is empty or has only one element, otherwise it returns the value of the second greatest element. Based on the classes provided below, write the implementation of Second in the solution box, including any helper functions (if any) that will be tased. class TreeNode public: 11 ...... private int data; Treelilodeleft; TreeNode* right; friend class BinarySearch Tree: class BinarySearch Tree public: // ...... private: Treelode* root;

Answer 1

class TreeNode
{
public: //

private: int data;
TreeNode * left;
TreeNode * right;
friend class BinarySearchTree;
};

class BinarySearchTree
{
public:
int c; //c is no of node in the tree
void findSecondLargest(TreeNode* root)
{
inorder(TreeNode* root);
cout<<arr[c-2]; //printing second largest
}
void inorder(TreeNode* root,int arr) //Inorder traversal
{
int i=0;
if(!TreeNode)
return;
inorder(TreeNode->left);
arr[i++]=TreeNode->data;
inorder(TreeNode->right);
}

private:
TreeNode *root;
int arr[c]; //arr[] is a array to store the inorder traversal
};

Lets take a binary tree 30 Traversal In Order of the The tree ina is In Order = - In Order = left Node, root, right rede 13, 15, 18, 20, 25, 29, 30, 32 Grr [g] = [13, 15, 18, 20, 25, 29, 30, 32] 7 6 2 4 1 3 index to c=8 - The second largest is I arr. [-2 ] = are[6] . 30