Binary TreesMaximum Depth of Binary Tree

solution.py

⌘↵ run

Maximum Depth of Binary Tree

easy

You've got this! Start small, think out loud.

Given the root of a binary tree, return its maximum depth. The maximum depth is the number of nodes along the longest path from the root down to the farthest leaf.

Time:O(n)

Space:O(h)

recursiondfsgoogle-favorite

Need a refresher? Back to Learn

OUTPUT

Run your code to see output