Maximum Depth of Binary Tree · Coding Interview Practice

Maximum Depth of Binary TreeGiven the root of a binary tree, return its maximum depth (the number of nodes along the longest root-to-leaf path).Constraints

The number of nodes is in the range [0, 10^4]

-100 <= Node.val <= 100

Examples

Input: root = [3,9,20,null,null,15,7] Output: 3

Input: root = [1,null,2] Output: 2

Practise this challengeAll coding challenges

LetsDiscuss

Loading your session…