Maximum Depth of Binary Tree

Try to solve the Maximum Depth of Binary Tree problem.

Statement

You are given the root of a binary tree, and your task is to determine the maximum depth of this tree. The maximum depth of a binary tree is determined by the count of nodes found on the longest pathway from the root node to the farthest leaf node.

Constraints:

  • The number of nodes in the tree is in the range [0,500].[0, 500].

  • 100-100 \leqNode.data 100\leq 100

Examples

Create a free account to view this lesson.

By signing up, you agree to Educative's Terms of Service and Privacy Policy