【代码随想录训练营】Day21-二叉树

最新推荐文章于 2024-07-08 05:07:33 发布

Koffer-debug

最新推荐文章于 2024-07-08 05:07:33 发布

阅读量1.6k

点赞数

分类专栏：代码随想录训练营文章标签： leetcode 算法 java

本文链接：https://blog.csdn.net/weixin_38255385/article/details/127627327

版权

代码随想录训练营 Day21

今日任务

530.二叉搜索树的最小绝对差
 501.二叉搜索树中的众数
 236.二叉树的最近公共祖先
语言：Java

530. 二叉搜索树的最小绝对差

链接：https://leetcode.cn/problems/minimum-absolute-difference-in-bst/
递归

/**
 * 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 result; //any two different nodes in the trees, need not to be adjacent
    TreeNode preNode; //记录的是前一个遍历的节点，不是父节点
    public void traversal(TreeNode root){
   
        if(root == null){
   
            return;
        }
        traversal(root.left);
        if(preNode != null){
   
            result = Math.min(result, root.val - preNode.val);
        }
        preNode = root;
        traversal(root.right);
    }
    public int getMinimumDifference(TreeNode root) {
   
        result = 100001;
        preNode = null;
        traversal(root);
        return result;
    }
}

迭代

class Solution {
   
    public int getMinimumDifference(TreeNode root) {
   
        TreeNode preNode = null;
        TreeNode curNode = root;
        int result = 100001;
        Stack<TreeNode> stack = new Stack<TreeNode>();
        while(