Locked

Pass the Dictionary check first

Everything after it builds on dictionaries. Each rep in the check has to be passed without opening the solution. Hints and Basics are fine.

Still to clear · 8 of 8

Continue the check

Preview · where this ladder is heading

Invert Binary Tree

Turn a binary tree into its mirror image: at every node, the left and right subtrees trade places. Return the root of the mirrored tree.

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

You can read it now. The editor opens when the check is cleared.