The Mirror Flip
A easy Python mock interview question on DataDriven. Practice with AI-powered feedback, real code execution, and a hire/no-hire decision.
- Domain
- Python
- Difficulty
- easy
- Seniority
- L3
Interview Prompt
Given the root of a binary tree (nested dict with 'val', 'left', 'right'), return a new tree where every node's left and right children are swapped recursively.
Summary
Sometimes the fastest fix is to swap everything.
How This Interview Works
- Read the vague prompt (just like a real interview)
- Ask clarifying questions to the AI interviewer
- Write your python solution with real code execution
- Get instant feedback and a hire/no-hire decision