JAVA_Minimum Absolute Difference in BST_LeetCode 530 풀이 class Solution { Integer ans = Integer.MAX_VALUE; TreeNode prev; public int getMinimumDifference(TreeNode root) { dfs(root); return ans; } public void dfs(TreeNode node) { if (node == null) return; dfs(node.left); if (prev != null) { ans = Math.min(ans, node.val - prev.val); } prev = node; dfs(node.right); } } * 출처 Minimum Absolute Difference in BST - LeetCode Minimum Absolute Difference in BST - Given the root of a Binary Search Tree (BST)...
#
JAVA
#
JAVA_LeetCode530
#
JAVA_MinimumAbsoluteDifferenceinBST
#
JAVA_MinimumAbsoluteDifferenceinBST_LeetCode530
#
MinimumAbsoluteDifferenceinBST_LeetCode530
