LeetCode 897: Increasing Order Search Tree Solution

Master LeetCode problem 897 (Increasing Order Search Tree), a easy challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

897. Increasing Order Search Tree

Easy

Stack Tree Depth-First Search Binary Search Tree Binary Tree

Problem Explanation

Explanation

To solve this problem, we can perform an in-order traversal of the given binary search tree. During the traversal, we construct a new tree by rearranging the nodes in the required order. We maintain a pointer to the current node in the new tree and adjust the left and right pointers accordingly. At the end of the traversal, the new tree will be the desired tree with the leftmost node as the root and every node having no left child and only one right child.

Algorithmic Steps:

Create a dummy node to be the root of the new tree.
Perform an in-order traversal of the original tree.
During traversal, update the current node's left child to null and set the current node as the right child of the new tree's current node.
Update the current node to its right child.
Continue until all nodes are processed.
Return the right child of the dummy node as the root of the new tree.

Time Complexity: The time complexity of this approach is O(N), where N is the number of nodes in the tree.

Space Complexity: The space complexity is also O(N) due to the space used for the recursion stack and the new tree structure.

Solution Code

class Solution {
    TreeNode prev = new TreeNode(-1);
    TreeNode dummy = prev;

    public TreeNode increasingBST(TreeNode root) {
        if (root == null) return null;
        
        increasingBST(root.left);
        
        prev.right = new TreeNode(root.val);
        prev = prev.right;
        
        increasingBST(root.right);
        
        return dummy.right;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 897 (Increasing Order Search Tree)?

This page provides optimized solutions for LeetCode problem 897 (Increasing Order Search Tree) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 897 (Increasing Order Search Tree)?

The time complexity for LeetCode 897 (Increasing Order Search Tree) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 897 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 897 in Java, C++, or Python.

Back to LeetCode Solutions