Leetcode 226. Invert Binary Tree
Given the root of a binary tree, invert it by producing its mirror image—swap the left and right child of every node—and return the root. This is a straightforward tree-traversal problem that touches each node once.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Your account is free and you can post anonymously if you choose.