Thursday, March 4, 2021
More

    Minimum Depth of Binary Tree

    Must Read

    Programmerhttp://www.improgrammer.net
    We started this site to inspire young minds to motivate and encourage them towards Programming Language. In this site you will get programming tutorials, tech, programming facts, programming fun and programming blogs.

    Given a binary tree, find its minimum depth.

    The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.


    Approach 1:

    /**
     * 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){
             if(root.right==null){
                 return 1 + minDepth(root.left);
             }
             if(root.left==null){
                 return 1 + minDepth(root.right);
             }
             
                return  1 + Math.min(minDepth(root.left),minDepth(root.right));
            }
            else 
                return 0;
        }
    }

     

    Latest Articles

    More Recipes Like This