Minimum Depth of Binary Tree

1. Title

Minimum Depth of Binary Tree

2. Http address

https://leetcode.com/problems/minimum-depth-of-binary-tree/

3. The question

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.

4 My code(AC)

•     public static int DFS(TreeNode root, int depth,int min){
          
          if( root == null)
              return Math.min(depth, min);
          if( root.left == null && root.right == null)
          {
              return Math.min(depth + 1, min);
          }
          
          int min_left = Integer.MAX_VALUE;
          if( root.left != null)
                  min_left = DFS(root.left, depth + 1, min);
          int min_right = Integer.MAX_VALUE;
          if( root.right != null)
              min_right = DFS(root.right, depth + 1, min);
          
          return Math.min(min_left, min_right);
      }
      
      // Accepted
        public static int minDepth(TreeNode root) {
           
            return DFS(root,0,Integer.MAX_VALUE);
          }