The Mirror Flip

A easy Python interview practice problem on DataDriven. Write and execute real python code with instant grading.

Domain

Python

Difficulty

easy

Seniority

L3

Problem

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.

Practice This Problem

Solve this Python problem with real code execution. DataDriven runs your Python code in a real environment and grades it automatically.