Breaking News: Grepper is joining You.com. Read the official announcement!

recover binary search tree

Aniket Keshri answered on April 20, 2022 Popularity 9/10 Helpfulness 1/10

answer recover binary search tree

recover binary search tree

Comment

 void correctBST( Node root )
    {
        // Initialize pointers needed
        // for correctBSTUtil()
        first = middle = last = prev = null;
 
        // Set the pointers to find out
        // two nodes
        correctBSTUtil( root );
 
        // Fix (or correct) the tree
        if( first != null && last != null )
        {
            int temp = first.data;
            first.data = last.data;
            last.data = temp;
        }
        // Adjacent nodes swapped
        else if( first != null && middle !=
                                    null )
        {
            int temp = first.data;
            first.data = middle.data;
            middle.data = temp;
        }
 
        // else nodes have not been swapped,
        // passed tree is really BST.
    }

Popularity 9/10 Helpfulness 1/10 Language whatever

Source: Grepper

Tags: binary-search-tree recover whatever

Link to this answer
Share Copy Link

Contributed on Apr 20 2022

Aniket Keshri

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

recover binary search tree

Contents

More Related Answers

recover binary search tree

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.