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).
Input Format
Input is managed for you.
Output Format
Output is managed for you.
Constraints
0 <= Number of Nodes <= 10^9 -10^9 <= value of Node data <= 10^9
Notice
Try First, Check Solution later
1. You should first read the question and watch the question video.2. Think of a solution approach, then try and submit the question on editor tab.3. We strongly advise you to watch the solution video for prescribed approach.Example
Input
13 7 3 2 -1 -1 10 -1 -1 5 -1 12 -1 -1
Output
3 -> 7 <- 10 2 -> 3 <- 5 . -> 2 <- . . -> 5 <- . . -> 10 <- 12 . -> 12 <- .