[LeetCode] 951. Flip Equivalent Binary Trees_Medium tag: DFS, divide and conquer

For a binary tree T, we can define a flip operation as follows: choose any node, and swap the left and right child subtrees. A binary tree X is flip e