JAVA solution


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

Log in to reply
 

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