JAVA_Maximum Depth of Binary Tree_LeetCode 104

JAVA_Maximum Depth of Binary Tree_LeetCode 104 Maximum Depth of Binary Tree 풀이 class Solution { public int maxDepth(TreeNode root) { return root==null ? 0 : 1 + Math.max(maxDepth(root.left),maxDepth(root.right)); } } * 출처 https://leetcode.com/problems/maximum-depth-of-binary-tree/ Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com...

원문링크 : JAVA_Maximum Depth of Binary Tree_LeetCode 104