Friday, November 22, 2013

Recover Binary Search Tree

Two elements of a binary search tree (BST) are swapped by mistake.
Recover the tree without changing its structure.
Note:
A solution using O(n) space is pretty straight forward.
Posted by at

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)