![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
BST
lyangpku
这个作者很懒,什么都没留下…
展开
-
[LeetCode] 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) {} * }; */ class Soluti原创 2013-01-24 18:21:25 · 380 阅读 · 0 评论 -
[LeetCode] Convert Sorted List to Binary Search Tree
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ /** * Definition for binary tree * stru原创 2013-01-24 14:52:36 · 411 阅读 · 0 评论 -
[LeetCode] Unique Binary Search Tree
class Solution { public: int numTrees(int n) { // Start typing your C/C++ solution below // DO NOT write int main() function vector dp(n + 1); dp[原创 2013-01-24 18:47:20 · 354 阅读 · 0 评论 -
[LeetCode] Recover Binary Search Tree
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Soluti原创 2013-01-24 18:17:19 · 639 阅读 · 0 评论 -
[LeetCode] Convert Sorted Array to Binary Search Tree
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Soluti原创 2013-01-24 14:56:37 · 318 阅读 · 0 评论