Recover Binary Search Tree
Two elements of a binary search tree (BST) are swapped by mistake.
Recover the tree without changing its structure.
A solution using O(n) space is pretty straight forward.
Could you devise a constant space solution?
Login to see Answer and Coaching Session
More interview questions