leetcode
文章平均质量分 62
huatianuu
这个作者很懒,什么都没留下…
展开
-
Recover Binary Search Tree
Two elements of a binary search tree (BST) are swapped by mistake. Recover the tree without changing its structure. /** * Definition for binary tree * struct TreeNode { * int val; *原创 2015-01-09 16:24:13 · 298 阅读 · 0 评论 -
Validate Binary Search Tree
方案一:本方法,先遍历左子树,然后又子树。 /** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {}原创 2014-12-28 16:36:43 · 217 阅读 · 0 评论