Skip to main content
Maximum Depth of Binary Tree | AlgoCracked
AlgoCracked
ProblemsMaximum Depth of Binary Tree
Easy74.0% acceptance
Blind75TreeDfsBfsRecursion

Maximum Depth of Binary Tree

Return the maximum depth of a binary tree — the number of nodes along the longest path from the root down to a leaf. Input format Level-order JSON array with nulls, e.g. [[3,9,20,null,null,15,7]] . TreeNode is predefined.

Loading workspace…