Skip to content

Overview Resume Score

Practice

LarpCode Reps LarpTalk

Interview

Templates Sessions

recent

Loading problem

Invert Binary Tree · easy trees interview problem · Larpy

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.

Figure

level order, nulls omitted

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

More trees problems

Maximum Depth of a Binary Treeeasy
Balanced Binary Treeeasy
Diameter of Binary Treeeasy
Subtree of Another Treeeasy
Count Complete Tree Nodeseasy
Path Sumeasy