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.
判断一棵二叉树是不是由另一棵二叉树的部分节点交换左右子树得到的。
主要思路还是采用递归的思想,判断二叉树中每个节点的左右子树是否满足该条件,判断节点子树是否满足的条件有:
flipEquiv(root1.left, root2.left) && flipEquiv(root1.right, root2.right)) || (flipEquiv(root1.left, root2.right) && flipEquiv(root1.right, root2.left)
const flipEquiv = (root1, root2) => {
if (!root1 && !root2) {
return true
}
if (!root1 || !root2) {
return false
}
if (root1.val === root2.val) {
return (flipEquiv(root1.left, root2.left) && flipEquiv(root1.right, root2.right)) || (flipEquiv(root1.left, root2.right) && flipEquiv(root1.right, root2.left))
} else {
return false
}
}
如果本文对您有帮助,欢迎关注微信公众号,为您推送更多大前端相关的内容, 欢迎留言讨论,ε=ε=ε=┏(゜ロ゜;)┛。
您还可以在这些地方找到我: