Question

Remove the second largest item from a BST. Write the complete code for this assuming you have integer data in a node. C++ code only.

int remove_second_L(node *& root)

{

if(!root)

return 0;

// Implement the rest thank you

}

Answer 1

Hi i am answering your question giving you the Program to find second largest element in a BST ,Hope this will be helpful to you kindly try to delete the Element yourself and if you found any difficulty i ll do accordingly,Happy to help:)

code:-

#include<iostream>
using namespace std;

struct Node
{
   int key;
   Node *left, *right;
};

Node *Create_New_Node(int item)
{
   Node *temp = new Node;
   temp->key = item;
   temp->left = temp->right = NULL;
   return temp;
}

void Second_Largest_Element(Node *root, int &c)
{

   if (root == NULL || c >= 2)
       return;

   Second_Largest_Element(root->right, c);
   c++;
   if (c == 2)
   {
       cout << "2nd largest element is "
           << root->key << endl;
       root->key == NULL;
       return;
   }

   Second_Largest_Element(root->left, c);
}

void Sec_Large(Node *root)
{
   int c = 0;
   Second_Largest_Element(root, c);
}

Node* Insert_Node(Node* node, int key)
{
   if (node == NULL) return Create_New_Node(key);
   if (key < node->key)
       node->left = Insert_Node(node->left, key);
   else if (key > node->key)
       node->right = Insert_Node(node->right, key);
   return node;
}

int main()
{
   Node *root = NULL;
   root = Insert_Node(root, 50);
   Insert_Node(root, 30);
   Insert_Node(root, 20);
   Insert_Node(root, 40);
   Insert_Node(root, 70);
   Insert_Node(root, 60);
   Insert_Node(root, 80);

   Sec_Large(root);

   return 0;
}

output:-