_951. Flip Equivalent Binary Trees.md

951. Flip Equivalent Binary Trees

All prompts are owned by LeetCode. To view the prompt, click the title link above.

Back to top

---

First completed : October 24, 2024

Last updated : October 24, 2024

---

Related Topics : Tree, Depth-First Search, Binary Tree

Acceptance Rate : 69.8 %

---

Solutions

• m951 oneliner expanded.py
• m951 oneliner.py
• m951.py

Python

m951 oneliner expanded.py

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def flipEquiv(self, root1: Optional[TreeNode], root2: Optional[TreeNode]) -> bool:
        def equiv(left: Optional[TreeNode], right: Optional[TreeNode]) -> bool :
            return False if ((not left or not right) and (left or right)) or \
                            (left and right and left.val != right.val) \
                         else (not left and not right) or \
                              (equiv(left.left, right.left) and equiv(left.right, right.right)) or \
                              (equiv(left.right, right.left) and equiv(left.left, right.right))

        return equiv(root1, root2)

m951 oneliner.py

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def flipEquiv(self, root1: Optional[TreeNode], root2: Optional[TreeNode]) -> bool:
        def equiv(left: Optional[TreeNode], right: Optional[TreeNode]) -> bool :
            return False if ((not left or not right) and (left or right)) or (left and right and left.val != right.val) else (not left and not right) or (equiv(left.left, right.left) and equiv(left.right, right.right)) or (equiv(left.right, right.left) and equiv(left.left, right.right))

        return equiv(root1, root2)

m951.py

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def flipEquiv(self, root1: Optional[TreeNode], root2: Optional[TreeNode]) -> bool:
        def equiv(left: Optional[TreeNode], right: Optional[TreeNode]) -> bool :
            if not left and not right :
                return True
            if not left or not right :
                return False
            if left.val != right.val :
                return False
            return (equiv(left.left, right.left) and equiv(left.right, right.right)) or \
                   (equiv(left.right, right.left) and equiv(left.left, right.right))
        return equiv(root1, root2)