Loading your interview setup

Skip to content

Overview Resume Score

Practice

The Daily LarpCode Reps LarpTalk

Interview

Templates Sessions

recent

Loading

easy· trees Mock interview

Invert Binary Tree

Given the root of a binary tree, swap every node's left and right child (mirror the whole tree) and return the root.

Examples

in: root = [4,2,7,1,3,6,9]

out: [4,7,2,9,6,3,1]

mirrored

in: root = []

out: []

empty stays empty

Constraints

0 <= number of nodes <= 100
-100 <= node value <= 100

Hints

target: O(n) time⌘↩ run · ⇧⌘↩ submit