Package g0801_0900.s0897_increasing_order_search_tree

Class Solution

java.lang.Object

g0801_0900.s0897_increasing_order_search_tree.Solution

public class Solution
extends Object

897 - Increasing Order Search Tree\. Easy Given the `root` of a binary search tree, rearrange the tree in **in-order** so that the leftmost node in the tree is now the root of the tree, and every node has no left child and only one right child. **Example 1:**  **Input:** root = [5,3,6,2,4,null,8,1,null,null,null,7,9] **Output:** [1,null,2,null,3,null,4,null,5,null,6,null,7,null,8,null,9] **Example 2:**  **Input:** root = [5,1,7] **Output:** [1,null,5,null,7] **Constraints:** * The number of nodes in the given tree will be in the range `[1, 100]`. * `0 <= Node.val <= 1000`

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
TreeNode	increasingBST(TreeNode root)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

increasingBST

public TreeNode increasingBST(TreeNode root)