Java Solution


  • 0
    N
       public static int minDepth(Treenode root) {
            if(root == null) {
                return 0;
            }
            if(root.right != null && root.left == null) {
                return minDepth(root.right) + 1;
            }
    
            if(root.left != null && root.right == null) {
                return minDepth(root.left) + 1;
            }
    
            return Math.min(minDepth(root.right), minDepth(root.left)) + 1;
        }
    

  • 0
    J

    '''
    public int minDepth(TreeNode root) {
    if (null == root) {
    return 0;
    }

        int left = minDepth(root.left);
        int right = minDepth(root.right);
        
        if (left == 0 || right == 0) {
            return Math.max(left, right) + 1;
        } else {
            return Math.min(left, right) + 1;            
        }
    }
    

    '''


Log in to reply
 

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