Maximum Depth / Tree Traversal

Question

## Problem

Compute the maximum depth of a tree (e.g., a nested issue/sub-issue structure).

## Example
```
issue tree -> max depth
```

## Constraints
- up to 10^4 nodes

## Approach
DFS/BFS. Linear screens lean conceptual with pseudocode + complexity discussion.