JAVA_Second Minimum Node In a Binary Tree

JAVA_Second Minimum Node In a Binary Tree_LeetCode 671 풀이 class Solution { int min = Integer.MAX_VALUE; int min2 = Integer.MAX_VALUE; boolean chk = false; public int findSecondMinimumValue(TreeNode root) { if(root == null) return 0; if(root.val < min) { min = root.val; } if(root.val > min && root.val <= min2) { chk = true; min2 = root.val; } findSecondMinimumValue(root.left); findSecondMinimumValue(root.right); return !chk ? -1 : min2 ; } } * 출처 Second Minimum Node In a Binary Tree - LeetCode Se...

#JAVA #JAVA_LeetCode671 #JAVA_SecondMinimumNodeInaBinaryTree #JAVA_SecondMinimumNodeInaBinaryTree_LeetCode671 #SecondMinimumNodeInaBinaryTree_LeetCode671

원문링크 : JAVA_Second Minimum Node In a Binary Tree_LeetCode 671