Flip Equivalent Binary Trees

Determine whether two binary trees are identical up to any number of left/right child swaps at nodes — i.e., whether you can make one tree equal to the other by flipping children. The core task is to recursively verify that node values match and each pair of subtrees can be matched either directly or after swapping.