python3

javascript

java

Increasing Order Search Tree

You are 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.
```
Class TreeNode:
    val (int)
    left (TreeNode)
    right (TreeNode)
```

### Input Format:
Input1: root of the Binary Search Tree
### Output Format:
Return the Root of the rearranged Tree

### Sample Tests:
Case 1:
![img](https://devsnest-custom-images.s3.ap-south-1.amazonaws.com/inc1)
```
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]
```
Case 2:
![img](https://devsnest-custom-images.s3.ap-south-1.amazonaws.com/inc2)
```
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 <= value of Nodes <= 1000

TreeNode* solve(TreeNode* root){
//CODE HERE 
}

static TreeNode solve(TreeNode root){
//CODE HERE 
}