Tweaked Identical Binary Trees

Determine whether two given binary trees are identical assuming any number of ‘tweak’s are allowed. A tweak is defined as a swap of the children of one node in the tree.

Examples

/ \

3 8

/ \

1 4

and

/ \

8 3

/ \

1 4

the two binary trees are tweaked identical.

How is the binary tree represented?

We use the level order traversal sequence with a special symbol "#" denoting the null node.

For Example:

The sequence [1, 2, 3, #, #, 4] represents the following binary tree:

/ \

2 3

time: O(4 ^ log_2(n)) = O(n ^ 2), space: O(h)

/*** public class TreeNode {*   public int key;*   public TreeNode left;*   public TreeNode right;*   public TreeNode(int key) {*     this.key = key;*   }* }*/
public class Solution {public boolean isTweakedIdentical(TreeNode one, TreeNode two) {// Write your solution hereif(one == null && two == null) {return true;} else if(one == null || two == null) {return false;}else if(one.key != two.key) {return false;}return isTweakedIdentical(one.left, two.right) && isTweakedIdentical(one.right, two.left) || isTweakedIdentical(one.left, two.left) && isTweakedIdentical(one.right, two.right);}
}

转载于:https://www.cnblogs.com/fatttcat/p/10253373.html

Tweaked Identical Binary Trees - Medium相关推荐

LeetCode之All Possible Full Binary Trees（Kotlin）
问题: A full binary tree is a binary tree where each node has exactly 0 or 2 children. Return a list o ...
17. Merge Two Binary Trees 融合二叉树
［抄题］: Given two binary trees and imagine that when you put one of them to cover the other, some node ...
LeetCode 617. Merge Two Binary Trees
题目: Given two binary trees and imagine that when you put one of them to cover the other, some nodes ...
C#LeetCode刷题之#617-合并二叉树（Merge Two Binary Trees）
问题该文章的最新版本已迁移至个人博客[比特飞],单击链接 https://www.byteflying.com/archives/4096 访问. 给定两个二叉树,想象当你将它们中的一个覆盖到另一个 ...
Given two binary trees, write a function to check if they areequal or not.
Given two binary trees, write a function to check if they areequal or not. Two binary trees are cons ...
(数据结构基础)Among the following threaded binary trees (the threads are represented by dotted curves),……
当年学这些的时候真的是苦于没有人讲,现在复习考研,我会见到这种题就写下来,学弟学妹们欢迎点个关注,最近也在创业想实习的可以找我联系:没看懂的话是我表述有问题,欢迎指出和私戳. Among the fo ...
Rosalind第88题：Counting Rooted Binary Trees
Problem As in the case of unrooted trees, say that we have a fixed collection of taxa labeling the ...
617.Merge Two Binary Trees(合并两棵树)
Given two binary trees and imagine that when you put one of them to cover the other, some nodes of t ...
3/100. Merge Two Binary Trees
将两个二叉树相同位置的数值相加,相加的方法一样,则使用递归法挨个相加即可. # Definition for a binary tree node. # class TreeNode: # def _ ...

Tweaked Identical Binary Trees - Medium

Tweaked Identical Binary Trees - Medium相关推荐

最新文章

热门文章