Skip to main content

Create a BST and find inorder successor and inorder predecessor of specific node.

CODE:


#include <iostream>


using namespace std;


// Node definition

struct Node {

    int data;

    Node* left;

    Node* right;

    Node(int val) {

        data = val;

        left = nullptr;

        right = nullptr;

    }

};


// Insertion in BST

Node* insert(Node* root, int val) {

    if (root == nullptr) {

        return new Node(val);

    }

    if (val < root->data) {

        root->left = insert(root->left, val);

    } else {

        root->right = insert(root->right, val);

    }

    return root;

}


// Finding inorder successor

Node* findInorderSuccessor(Node* root, Node* target) {

    if (target->right != nullptr) {

        Node* current = target->right;

        while (current->left != nullptr) {

            current = current->left;

        }

        return current;

    } else {

        Node* successor = nullptr;

        Node* ancestor = root;

        while (ancestor != target) {

            if (target->data < ancestor->data) {

                successor = ancestor;

                ancestor = ancestor->left;

            } else {

                ancestor = ancestor->right;

            }

        }

        return successor;

    }

}


// Finding inorder predecessor

Node* findInorderPredecessor(Node* root, Node* target) {

    if (target->left != nullptr) {

        Node* current = target->left;

        while (current->right != nullptr) {

            current = current->right;

        }

        return current;

    } else {

        Node* predecessor = nullptr;

        Node* ancestor = root;

        while (ancestor != target) {

            if (target->data > ancestor->data) {

                predecessor = ancestor;

                ancestor = ancestor->right;

            } else {

                ancestor = ancestor->left;

            }

        }

        return predecessor;

    }

}


// Inorder traversal

void inorderTraversal(Node* root) {

    if (root == nullptr) {

        return;

    }

    inorderTraversal(root->left);

    cout << root->data << " ";

    inorderTraversal(root->right);

}


int main() {

    // Creating BST

    Node* root = nullptr;

    root = insert(root, 50);

    insert(root, 30);

    insert(root, 20);

    insert(root, 40);

    insert(root, 70);

    insert(root, 60);

    insert(root, 80);


    cout << "Inorder traversal of the BST: ";

    inorderTraversal(root);

    cout << endl;


    Node* target = root->right->right; // Assuming target node is 80


    // Finding inorder successor

    Node* successor = findInorderSuccessor(root, target);

    if (successor != nullptr) {

        cout << "Inorder successor of " << target->data << " is " << successor->data << endl;

    } else {

        cout << "No inorder successor found for " << target->data << endl;

    }


    // Finding inorder predecessor

    Node* predecessor = findInorderPredecessor(root, target);

    if (predecessor != nullptr) {

        cout << "Inorder predecessor of " << target->data << " is " << predecessor->data << endl;

    } else {

        cout << "No inorder predecessor found for " << target->data << endl;

    }


    return 0;

}





Popular posts from this blog

krushnaaa

  import java . awt .* ; import java . awt . event .* ; public class SimpleAWTExample {     public static void main ( String [] args ) {         // Create a Frame         Frame frame = new Frame ( "Simple AWT Example" );         // Create a Button         Button button = new Button ( "Click Me!" );         // Set layout for the Frame         frame . setLayout ( new FlowLayout ());         // Add the Button to the Frame         frame . add ( button );         // Set size of the Frame         frame . setSize ( 300 , 200 ); // Width: 300 pixels, Height: 200 pixels         // Make the Frame visible         frame . setVisible ( true );         // Add a WindowListener to handle closing event     ...
Read more

Write a program to create a class Student2 along with two method getData (), printData () to get the value through argument and display the data in printData. Create the two objects s1, s2 to declare and access the values from class STtest.

 CODE: import java.util.Scanner; class Student2 {     private String name;     private int age;          // Method to set data     public void getData(String name, int age) {         this.name = name;         this.age = age;     }          // Method to print data     public void printData() {         System.out.println("Name: " + name);         System.out.println("Age: " + age);     } } public class STtest {     public static void main(String[] args) {         Scanner scanner = new Scanner(System.in);                  // Creating objects of Student2 class         Student2 s1 = new Student2();         Student2 s2 = new Student2();              ...
Read more

Create an in-order threaded binary search tree and perform the traversals.(Double Thread)

 CODE: #include <iostream> using namespace std; struct Node {     int data;     Node* left;     Node* right;     bool leftThread;     bool rightThread; }; Node* createThreadedBST(int arr[], int n) {     Node* root = nullptr;     for (int i = 0; i < n; ++i) {         Node* newNode = new Node;         newNode->data = arr[i];         newNode->left = newNode->right = nullptr;         newNode->leftThread = newNode->rightThread = true;         if (root == nullptr) {             root = newNode;         } else {             Node* current = root;             Node* parent = nullptr;             while (true) {                ...
Read more