Solving Maximum Depth of Binary Tree using DFS/BFS.

Problem

Find tree depth.

Pattern

This problem demonstrates the DFS/BFS pattern.

Approach

Recursive max of left/right + 1.

Solution 

  // Solution for Maximum Depth of Binary Tree
// Pattern: DFS/BFS
// O(n) time

Complexity

O(n) time

Best Practices

  • Identify the pattern before coding — pattern recognition saves time
  • Handle edge cases: empty input, single element, duplicates
  • Use descriptive variable names even in timed interviews
  • Test with the provided examples plus one custom case