摘要: 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 @ 2014-12-18 23:56 birdhack 阅读(121) 评论(0) 推荐(0) 编辑