二叉查找树
文章平均质量分 52
tangyifei1991
这个作者很懒,什么都没留下…
展开
-
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 tre原创 2014-01-20 16:04:28 · 318 阅读 · 0 评论 -
Unique Binary Search Trees II 二叉查找树的路径
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ cla原创 2014-01-20 15:39:14 · 404 阅读 · 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) {} * }; */ cla原创 2014-01-20 15:43:37 · 389 阅读 · 0 评论 -
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) {} * }; */ cla原创 2014-01-20 15:59:51 · 405 阅读 · 0 评论 -
Unique Binary Search Trees 二叉查找树的数量
class Solution { public: int numTrees(int n) { vector dp(n+1,0); dp[0]=1; dp[1]=1; for(int i=2;i { for(int k=1;k {原创 2014-01-20 15:36:20 · 411 阅读 · 0 评论