530.二叉搜索树的最小绝对差
思路:
中序遍历来更新相邻节点的差值,又因为其为二叉搜索树,所以中序遍历为递增,不用考虑其正负。
代码:
class Solution {
TreeNode pre;
int res = Integer.MAX_VALUE;
public int getMinimumDifference(TreeNode root) {
if(root == null) return 0;
process(root);
return res;
}
public void process(TreeNode root){
if(root == null) return;
process(root.left);
if(pre != null){
res = Math.min(res, root.val - pre.val);
}
pre = root;
process(root.right);
}
}
需要注意的点:
501.二叉搜索树中的众数
思路:
中序遍历二叉树,处理节点时先对其进行计数判断的处理(判断其在上一个节点是否出现过),再对其计数进行是否是众数的判断,并更新众数的次数和众数。
代码:
class Solution {
ArrayList<Integer> reslist;
int count;//计数
int maxcount;//众数
TreeNode pre;
public int[] findMode(TreeNode root) {
count = 0;
maxcount = 0;
reslist = new ArrayList<>();
pre = null;
process(root);
int[] res = new int[reslist.size()];
for(int i = 0; i < reslist.size(); i++){
res[i] = reslist.get(i);
}
return res;
}
private void process(TreeNode root){
if(root == null) return;
process(root.left);
if(pre == null || root.val != pre.val){
count = 1;
}else{
count++;
}
if(count > maxcount){
reslist.clear();
reslist.add(root.val);
maxcount = count;
}else if(count == maxcount){
reslist.add(root.val);
}
pre = root;
process(root.right);
}
}
需要注意的点:
236. 二叉树的最近公共祖先
思路:
自下而上传递信息需要用后序遍历.
代码:
class Solution {
public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
if(root == null || root == p || root == q){
return root;
}
TreeNode left = lowestCommonAncestor(root.left, p, q);
TreeNode right = lowestCommonAncestor(root.right, p, q);
if(left == null && right == null){
return null;
}else if(left != null && right == null){
return left;
}else if(left == null && right != null){
return right;
}else{
return root;
}
}
}