Wednesday, February 12, 2014

Recover Binary Search Tree @LeetCode

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. Could you devise a constant space solution?
Posted by at
Labels: ,

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)