Package g0901_1000.s0951_flip_equivalent_binary_trees

Class Solution

java.lang.Object

g0901_1000.s0951_flip_equivalent_binary_trees.Solution

public class Solution
extends Object

951 - Flip Equivalent Binary Trees\. Medium 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 equivalent or `false` otherwise. **Example 1:**  **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 **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]`.

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
boolean	flipEquiv(TreeNode root1, TreeNode root2)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

flipEquiv

public boolean flipEquiv(TreeNode root1,
 TreeNode root2)