Find the Two Swapped Nodes

Hard Binary Search Tree (Advanced)

Two keys of a BST were swapped by mistake. Given the inorder traversal of the damaged tree, print the two swapped values in increasing order.

Constraints

2 <= n <= 10^5

No discussions yet.