[LeetCode] Unique Binary Search Trees II
来源:互联网 发布:程序员接私活赚钱吗 编辑:程序博客网 时间:2024/06/02 03:14
Given n, generate all structurally unique BST's (binary search trees) that store values 1...n.
For example,
Given n = 3, your program should return all 5 unique BST's shown below.
1 3 3 2 1 \ / / / \ \ 3 2 1 1 3 2 / / \ \ 2 1 2 3
confused what "{1,#,2,3}"
means? > read more on how binary tree is serialized on OJ.
OJ's Binary Tree Serialization:
The serialization of a binary tree follows a level order traversal, where '#' signifies a path terminator where no node exists below.
Here's an example:
1 / \ 2 3 / 4 \ 5The above binary tree is serialized as
"{1,2,3,#,#,4,#,#,5}"
.Analysis:
The basic idea is still using the DFS scheme. It is a little hard to think the structure of the argument list in the function. It is clear that for each tree/subtree, we will set the root as the start position to the end position, and recursively construct the left subtree with the left part and the right subtree with the right part.
So first we can have
void dfs (int st, int ed ){
if (st>ed) { // generate a null node }
else{
for (int i=st;i<=ed;i++){
dfs(st,i-1, ); //generate left subtree
dfs(i+1,ed, ); // generate right subtree
}
}
}
Next step is to think about how to store all the possible solutions.
This is important ! Think about the root node, all the possible solutions of the tree are from the combinations of all the possible solutions of its left subtree, and its right subtree. One step further, if we have a root node and a left node, for the left node, still the subtrees below it are the combinations of the possible solutions of its left and right subtree, until the leaf node.
In other words, we store all the possible solutions for each node, instead of storing the only tree. So, we can have
void dfs(int st, int ed, vector<TreeNode *> res){}
in this function, recursively generate the left tree and right tree, then construct the current node, and push it to the current solution vector.
Details see the code.
The basic idea is still using the DFS scheme. It is a little hard to think the structure of the argument list in the function. It is clear that for each tree/subtree, we will set the root as the start position to the end position, and recursively construct the left subtree with the left part and the right subtree with the right part.
So first we can have
void dfs (int st, int ed ){
if (st>ed) { // generate a null node }
else{
for (int i=st;i<=ed;i++){
dfs(st,i-1, ); //generate left subtree
dfs(i+1,ed, ); // generate right subtree
}
}
}
Next step is to think about how to store all the possible solutions.
This is important ! Think about the root node, all the possible solutions of the tree are from the combinations of all the possible solutions of its left subtree, and its right subtree. One step further, if we have a root node and a left node, for the left node, still the subtrees below it are the combinations of the possible solutions of its left and right subtree, until the leaf node.
In other words, we store all the possible solutions for each node, instead of storing the only tree. So, we can have
void dfs(int st, int ed, vector<TreeNode *> res){}
in this function, recursively generate the left tree and right tree, then construct the current node, and push it to the current solution vector.
Details see the code.
c++
void treeGenerate(int st,int ed,vector<TreeNode *> &res){ if (st>ed){ res.push_back(NULL); }else{ for (int i=st;i<=ed;i++){ vector<TreeNode *> lefts; treeGenerate(st,i-1,lefts); vector<TreeNode *> rights; treeGenerate(i+1,ed,rights); for (int li = 0; li<lefts.size();li++) { for (int ri =0; ri<rights.size();ri++){ TreeNode* node = new TreeNode(i); node->left=lefts[li]; node->right=rights[ri]; res.push_back(node); } } } } } vector<TreeNode *> generateTrees(int n) { // Start typing your C/C++ solution below // DO NOT write int main() function vector<TreeNode*> res; treeGenerate(1,n,res); return res; }
java
public class Solution { ArrayList<TreeNode> result;public ArrayList<TreeNode> generateTrees(int n) { result = new ArrayList<TreeNode>();dfsTree(1, n,result); return result; }public void dfsTree(int start, int end, ArrayList<TreeNode> res){if(start>end) res.add(null);else{for(int i = start;i<=end;i++){ArrayList<TreeNode> leftNodes = new ArrayList<TreeNode>();dfsTree(start, i-1, leftNodes);ArrayList<TreeNode> rightNodes = new ArrayList<TreeNode>();dfsTree(i+1, end, rightNodes);for(int li = 0;li<leftNodes.size();li++){for(int ri = 0;ri<rightNodes.size();ri++){TreeNode node = new TreeNode(i);node.left = leftNodes.get(li);node.right = rightNodes.get(ri);res.add(node);}}}}}}
0 0
- LeetCode: Unique Binary Search Trees II
- LeetCode : Unique Binary Search Trees II
- [LeetCode] Unique Binary Search Trees II
- leetcode Unique Binary Search Trees II
- [LeetCode]Unique Binary Search Trees II
- [leetcode]Unique Binary Search Trees II
- LeetCode-Unique Binary Search Trees II
- [leetcode] Unique Binary Search Trees II
- LeetCode - Unique Binary Search Trees II
- LeetCode 95: Unique Binary Search Trees II
- Leetcode Unique Binary Search Trees II
- [LeetCode] Unique Binary Search Trees II
- Leetcode: Unique Binary Search Trees II
- leetcode Unique Binary Search Trees II
- 【Leetcode】Unique Binary Search Trees II
- LeetCode | Unique Binary Search Trees II
- Leetcode Unique Binary Search Trees II
- [LeetCode] Unique Binary Search Trees II
- Unity3D 物体旋转之Quaternion.Slerp
- iOS之Object-C基础编程之NSArray和NSMutableArray
- 增量式旋转编码器工作原理
- Unity3D Quaternion各属性和函数测试
- 连载:面向对象葵花宝典:思想、技巧与实践(23) - 领域建模三字经
- [LeetCode] Unique Binary Search Trees II
- android示例之音乐播放器第六天
- 【数据结构与算法】字典树(附完整源码)
- 【数据结构与算法】HashTable相关操作实现(附完整源码)
- 【数据结构与算法】内部排序总结(附各种排序算法源码)
- MFC Check-box Control 复选框操作
- 【数据结构与算法】内部排序之五:计数排序、基数排序和桶排序(含完整源码)
- 【数据结构与算法】内部排序之四:归并排序和快速排序(含完整源码)
- Visual Studio 2013 Update2