python3

javascript

java

Recover Binary Search Tree

You are given the `root` of a binary search tree (BST), where the values of exactly two nodes of the tree were swapped by mistake. Recover the tree without changing it's structure.

```
Class TreeNode:
    val (int)
    left (TreeNode)
    right (TreeNode)
```

### Input Format:
Root of the Binary Search Tree
### Output Format:
Return the Root of the Original Tree with correct nodes in-place.
### Sample Tests:
Case 1:
![img](https://devsnest-custom-images.s3.ap-south-1.amazonaws.com/recover1)
``` 
Input: root = [1,3,null,null,2]
Output: [3,1,null,null,2]
Explanation: node with value 3 cannot be a left child of 1 because 3 > 1. Swapping 1 and 3 makes the Binary Search Tree valid.
```
Case 2:

![img](https://devsnest-custom-images.s3.ap-south-1.amazonaws.com/recover2)

```
Input: root = [3,1,4,null,null,2]
Output: [2,1,4,null,null,3]
Explanation: node with value 2 cannot be in the right subtree of 3 because 2 < 3. Swapping 2 and 3 makes the Binary Search Tree valid.
```
### Constraints
+ The number of nodes in the tree is in the range [2, 1000].
+ -2^31^ <= value of Nodes <= 2^31^ - 1
 





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

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