# 0951. Flip Equivalent Binary Trees ## Description 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 equivalent* to a binary tree **Y** if and only if we can make **X** equal to **Y** after some number of flip operations. Given the roots of two binary trees `root1` and `root2`, return `true` if the two trees are flip equivelent or `false` otherwise. **Example 1:** ![Flipped Trees Diagram](https://assets.leetcode.com/uploads/2018/11/29/tree_ex.png) ``` **Input:** root1 = [1,2,3,4,5,6,null,null,null,7,8], root2 = [1,3,2,null,6,4,5,null,null,null,null,8,7] **Output:** true **Explanation:** We flipped at nodes with values 1, 3, and 5. ``` **Example 2:** ``` **Input:** root1 = [], root2 = [] **Output:** true ``` **Example 3:** ``` **Input:** root1 = [], root2 = [1] **Output:** false ``` **Example 4:** ``` **Input:** root1 = [0,null,1], root2 = [] **Output:** false ``` **Example 5:** ``` **Input:** root1 = [0,null,1], root2 = [0,1] **Output:** true ``` **Constraints:** * The number of nodes in each tree is in the range `[0, 100]`. * Each tree will have **unique node values** in the range `[0, 99]`. ## ac ```java ``` --- # Agent Instructions: Querying This Documentation If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question. Perform an HTTP GET request on the current page URL with the `ask` query parameter: ``` GET https://jaywin.gitbook.io/leetcode/solutions/0951-flip-equivalent-binary-trees.md?ask= ``` The question should be specific, self-contained, and written in natural language. The response will contain a direct answer to the question and relevant excerpts and sources from the documentation. Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.