前言:
五月集训,前面为学习内容,想要一起学习的可以看一看,最后的才是五月集训每天的作业。
一、知识点
二叉搜索树是满足一定规律,便于进行搜索数值的二叉树,即左右子树所有节点分别大于、小于当前节点。
二、课堂习题
这里的题均出自《算法零基础100讲》
去看专栏吧先。
三、作业
700. 二叉搜索树中的搜索
230. 二叉搜索树中第K小的元素
108. 将有序数组转换为二叉搜索树
1382. 将二叉搜索树变平衡
解题思路:
1.按照搜索树规律,判断递归搜索即可;
2.可以用层序遍历计数,找到第k小的元素则赋值返回;
3.用分治的思想对有序数组进行深搜,构建一个二叉搜索树;
4.可以将原来的树放进一个有序数组中,利用3中的解法,构建一个平衡二叉树。
代码:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
TreeNode ans;
public TreeNode searchBST(TreeNode root, int val) {
if(root == null) return null;
dfs(root,val);
return ans;
}
public void dfs(TreeNode node,int val){
if(node.val == val){
ans = node;
return;
}
if(node.val > val){
if(node.left != null) dfs(node.left,val);
}else if(node.val < val){
if(node.right != null) dfs(node.right,val);
}else ans = null;
}
}
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
int ans;
int cnt = 0;
public int kthSmallest(TreeNode root, int k) {
dfs(root,k);
return ans;
}
public void dfs(TreeNode node,int k){
if(node.left != null) dfs(node.left,k);
if(++cnt == k){
ans = node.val;
return;
}
if(node.right != null) dfs(node.right,k);
}
}
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public TreeNode sortedArrayToBST(int[] nums) {
return nums == null ? null : dfs(nums, 0, nums.length - 1);
}
private TreeNode dfs(int[] nums, int l, int r) {
if (l > r) {
return null;
}
int m = l + (r - l) / 2;
TreeNode root = new TreeNode(nums[m]);
root.left = dfs(nums, l, m - 1);
root.right = dfs(nums, m + 1, r);
return root;
}
}
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
List<Integer> list = new ArrayList<>();
public TreeNode balanceBST(TreeNode root) {
dfs(root);//
return buildTree(0,list.size()-1);
}
public TreeNode buildTree(int l,int r){
if(l>r) return null;
int mid = l+(r-l)/2;
TreeNode root = new TreeNode(list.get(mid));
root.left = buildTree(l,mid-1);
root.right = buildTree(mid+1,r);
return root;
}
public void dfs(TreeNode root){
if(root==null) return;
dfs(root.left);
list.add(root.val);
dfs(root.right);
}
}
四、总结
对于算法的掌握还是不够熟练,需要进行反复训练!
另外,剩下的课堂训练题目留到下个月的集训啦(●ˇ∀ˇ●)