Recover binary search tree

#1

i have tried this problem many times but unable to do it.
pls provide the complete code for this problem.

#2

@yutikakhanna, here the approach refer below link for the code :-

  1. Construct inorder traversal of the tree. It should be an almost sorted list where only two elements are swapped.
  2. Identify two swapped elements x and y in an almost sorted array in linear time.
  3. Traverse the tree again. Change value x to y and value y to x.
Recover binary search tree
#3

pls provide the complete code along with main function part

#4

@yutikakhanna, there is a error in the problem statement as in the input it is mentioned that first line will have integer denoting size of the input which is not provided to us , so there is another way of taking input refer this , i have commented some parts

In case of any doubt feel free to ask :slight_smile: