LeetCode //C - 951. Flip Equivalent Binary Trees
Summary: The problem determines if two binary trees are flip equivalent, meaning one can be transformed into the other via any number of subtree swaps. The solution uses recursion to check at each node whether the subtrees match either in their original or






