Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 951. 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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.