Recover Bst
easy
1. You are given a partially written function to solve(Refer question video). 2. You are given the root of a binary search tree (BST), where exactly two nodes of the tree were swapped by mistake. Recover the tree without changing its structure. Follow up: You are Not Allowed To Use Extra Space(Example : Storing All Element In Arrays).
Constraints
0 <= Number of Nodes <= 10^9 -10^9 <= value of Node data <= 10^9
Format
Input
Input is managed for you.
Output
Output is managed for you.
Example
Sample Input
13
7
3
2
-1
-1
10
-1
-1
5
-1
12
-1
-1
Sample Output
3 -> 7