LeetCode 104. Maximum Depth of Binary Tree



Given a binary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

Note: A leaf is a node with no children.


Given binary tree [3,9,20,null,null,15,7],

return its depth = 3.


List all scenarios of what a binary tree could be like:

  1. when a binary tree is null, simply return maximum depth as 0
  2. when a binary tree just have a root node, return maximum depth as 1
  3. when a binary tree has a root node and child nodes, maximum depth would be the depth of the bigger side between left and right subtrees plus 1.

Video Tutorial

Java Solution

Leave a Reply

Your email address will not be published. Required fields are marked *