摘要: 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 ... 阅读全文
posted @ 2015-01-21 22:03 vincently 阅读(186) 评论(0) 推荐(0) 编辑