JAVA_Minimum Distance Between BST Nodes

JAVA_Minimum Distance Between BST Nodes_LeetCode 783 풀이 class Solution { int min=Integer.MAX_VALUE; public int minDiffInBST(TreeNode root) { List<Integer> list= new ArrayList<>(); orderTree(root, list); for(int i = 0;i < list.size()-1;i++) min= Math.min(min, list.get(i+1)-list.get(i)); return min; } public void orderTree(TreeNode root, List<Integer> list){ if(root == null) return; orderTree(root.left, list); list.add(root.val); orderTree(root.right, list); } } * 출처 Minimum Distance Between BST N...

#JAVA #JAVA_LeetCode783 #JAVA_MinimumDistanceBetweenBSTNodes #JAVA_MinimumDistanceBetweenBSTNodes_LeetCode783 #MinimumDistanceBetweenBSTNodes_LeetCode783

원문링크 : JAVA_Minimum Distance Between BST Nodes_LeetCode 783