LeetCode 951. Flip Equivalent Binary Trees解题报告(python)

orientliu96

于 2019-11-20 16:26:05 发布

阅读量238

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/Orientliu96/article/details/103165239

LeetCode 专栏收录该内容

98 篇文章

订阅专栏

本文介绍了一种判断两棵二叉树是否通过翻转操作变得等价的方法。使用递归策略，比较两个二叉树节点的值，以及它们的左右子树，确保即使在翻转操作下也能保持等价性。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

1111. Maximum Nesting Depth of Two Valid Parentheses Strings

Flip Equivalent Binary Treespython solution

题目描述

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.
Write a function that determines whether two binary trees are flip equivalent. The trees are given by root nodes root1 and root2.

在这里插入图片描述

解析

仍然是递归解法。

class Solution:
    def flipEquiv(self, root1: TreeNode, root2: TreeNode) -> bool:
        if root1 is None and root2 is None: return True
        elif root1 is None or root2 is None: return False
        elif root1.val!=root2.val: return False
        elif self.flipEquiv(root1.left,root2.left) and self.flipEquiv(root1.right,root2.right): return True
        elif self.flipEquiv(root1.left,root2.right) and self.flipEquiv(root1.right,root2.left): return True
        else:
            return False