📝 **Task:** Build a tree with root=1, left=(2 with leaf 4), right=3. Print `max_depth(root)`. Expected: 3. 📋 Implement the function above. Test cases run automatically. 💡 **Hint:** Re-read the theory if you get stuck — the pattern is right there.