1 ms Easy to understand Java Solution


  • 0
    E
    /**
     * Definition for a binary tree node.
     * public class TreeNode {
     *     int val;
     *     TreeNode left;
     *     TreeNode right;
     *     TreeNode(int x) { val = x; }
     * }
     */
    public class Solution {
        public int minDepth(TreeNode root) {
            if(root==null){
                return 0;
            }
            else if(root.left!=null && root.right!=null){
                return Math.min(minDepth(root.left),minDepth(root.right))+1;
            }
            else if(root.left!=null){
                return minDepth(root.left)+1;
            }
            return minDepth(root.right)+1;
        }
    }
    

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.