JAVA_Balanced Binary Tree_LeetCode 110

JAVA_Balanced Binary Tree_LeetCode 110 Balanced Binary Tree 풀이 class Solution { public boolean isBalanced(TreeNode root) { return tree(root) != -1; } private int tree(TreeNode node) { if(node == null) return 1; int v1 = tree(node.left); int v2 = tree(node.right); if(v1 == -1 || v2 == -1) return -1; return Math.abs(v1 - v2) > 1 ? -1 : ((int) Math.max(v1, v2)) + 1; } } * 출처 Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your...

원문링크 : JAVA_Balanced Binary Tree_LeetCode 110