Package g0101_0200.s0104_maximum_depth_of_binary_tree

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    104 - Maximum Depth of Binary Tree.

    Easy

    Given the root of a binary tree, return its maximum depth.

    A binary tree's maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

    Example 1:

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

    Output: 3

    Example 2:

    Input: root = 1,null,2

    Output: 2

    Constraints:

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

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

    • 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 maxDepth(TreeNode root)

      • Methods inherited from class java.lang.Object

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