Flip Equivalent Binary Trees

LeetCode 951 • Medium • Trees • Anduril

Two trees are flip-equivalent if you can flip any nodes so they match. Recurse: no-flip or flip children.

TimeO(n)

SpaceO(h)

Root

A children

B flipped

step—

note—

Speed:

Ready

Press Play to walk the algorithm.

Whiteboard

Size:3

Type It

flipEquiv(root1, root2) — true if flip-equivalent.

═══ FLIP EQUIV (LC 951) ═══

PATTERN ▸ recursive OR of two pairings

① null/value checks

② same = flipEquiv(L,L)&flipEquiv(R,R)

or flipped L↔R

your implementation

Verify: