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.<p>Medium</p> <p>For a binary tree <strong>T</strong> , we can define a <strong>flip operation</strong> as follows: choose any node, and swap the left and right child subtrees.</p> <p>A binary tree <strong>X</strong> is <em>flip equivalent</em> to a binary tree <strong>Y</strong> if and only if we can make <strong>X</strong> equal to <strong>Y</strong> after some number of flip operations.</p> <p>Given the roots of two binary trees <code>root1</code> and <code>root2</code>, return <code>true</code> if the two trees are flip equivalent or <code>false</code> otherwise.</p> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2018/11/29/tree_ex.png" alt="Flipped Trees Diagram" /></p> <p><strong>Input:</strong> 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]</p> <p><strong>Output:</strong> true</p> <p><strong>Explanation:</strong> We flipped at nodes with values 1, 3, and 5.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> root1 = [], root2 = []</p> <p><strong>Output:</strong> true</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> root1 = [], root2 = [1]</p> <p><strong>Output:</strong> false</p> <p><strong>Constraints:</strong></p> <ul> <li>The number of nodes in each tree is in the range <code>[0, 100]</code>.</li> <li>Each tree will have <strong>unique node values</strong> in the range <code>[0, 99]</code>.</li> </ul>

  • Constructor Details

    • Solution

      public Solution()

  • Method Details