# Algorithm Puzzles: Maximum Depth of Binary Tree

Algorithm Puzzles ~~everyday~~ ~~every week~~ sometimes: Maximum Depth of Binary Tree

## Puzzle

Puzzle from leetcode:

Given the root of a binary tree, return its maximum depth.

A binary tree’s maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

## Solution

It’ an easy puzzle can be resolved via DFS:

1 | class Solution { |

T.C.: O(n)

S.C.: O(n)