# (LeetCode) 104. Maximum Depth of Binary Tree

## Maximum Depth of Binary Tree

• Explore : Interview > Top Interveiw Questions > Easy Collection
• 분류 : Trees
• 난이도 : Easy

### Problem

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.

#### Constraints

• The number of nodes in the tree is in the range [0, 10^4].
• -100 <= Node.val <= 100

### Solution

Exapnder

#### Point of Thinking

• DFS 문제이므로 재귀함수로 처리하면 간단하게 해결할 수 있다.