Minimum Depth of Binary Tree java solution


  • 1
    V

    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 && root.right == null){
            return minDepth(root.left) + 1;
        }
        if(root.left == null && root.right != null){
            return minDepth(root.right) + 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.