Package g0101_0200.s0111_minimum_depth_of_binary_tree

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    111 - Minimum Depth of Binary Tree.

    Easy

    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.

    Note: A leaf is a node with no children.

    Example 1:

    Input: root = 3,9,20,null,null,15,7

    Output: 2

    Example 2:

    Input: root = 2,null,3,null,4,null,5,null,6

    Output: 5

    Constraints:

    • The number of nodes in the tree is in the range <code>0, 10<sup>5</sup></code>.

    • -1000 &lt;= Node.val &lt;= 1000

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer minDepth(TreeNode root)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait