Share my AC Java Solution


  • 1
    S

    My AC Java Solution:

    public class Solution {
        public int minDepth(TreeNode root) {
            if(root == null)
                return 0;
            if(root.left == null && root.right == null)
                return 1;
            if(root.left == null)
                return 1 + minDepth(root.right);
            if(root.right == null)
                return 1 + minDepth(root.left);
            return 1 + Math.min(minDepth(root.left), minDepth(root.right));    
        }
    }

Log in to reply
 

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