2013年1月28日
LeetCode - Recover Binary Search Tree
摘要： Two elements of a binary search tree (BST) are swapped by mistake.Recover the tree without changing its structure. 阅读全文
posted @ 2013-01-28 09:45 cradle 阅读(549) 评论(0) 推荐(0) 编辑
LeetCode - Same Tree
摘要： Given two binary trees, write a function to check if they are equal or not. 阅读全文
posted @ 2013-01-28 08:43 cradle 阅读(221) 评论(0) 推荐(0) 编辑
LeetCode - Symmetric Tree
摘要： Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). 阅读全文
posted @ 2013-01-28 08:37 cradle 阅读(173) 评论(0) 推荐(0) 编辑