maximum_depth_of_binary_tree

README

< Previous 　　　　　　　　　　　　　　　　 Next >

104. Maximum Depth of Binary Tree (Easy)

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.

Example:

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

    3
   / \
  9  20
    /  \
   15   7

return its depth = 3.

Related Topics

[Tree] [Depth-first Search]

Similar Questions

1. Balanced Binary Tree (Easy)
2. Minimum Depth of Binary Tree (Easy)
3. Maximum Depth of N-ary Tree (Easy)