Fork me on GitHub

  2015年10月20日
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 ... 阅读全文
posted @ 2015-10-20 21:33 huashiyiqike 阅读(285) 评论(0) 推荐(0) 编辑