Inverted Subtree - Google Top Interview Questions


Problem Statement :


A tree is defined to be an inversion of another tree if either:

Both trees are null
Its left and right children are optionally swapped and its left and right subtrees are inversions.
Given binary trees source and target, return whether there's some inversion T of source such that it's a subtree of target. That is, whether there's a node in target that is identically same in values and structure as T including all of its descendants.

Constraints

n ≤ 12 where n is the number of nodes in target

Example 1

Input

source = [0, [1, null, [3, null, null]], [2, null, null]]

target = [5, [2, null, null], [0, [2, null, null], [1, [3, null, null], null]]]

Output

True


Solution :



title-img 




                        Solution in C++ :

bool recur(Tree* source, Tree* target) {
    if (!source && !target) return true;
    if (!source || !target || source->val != target->val) return false;
    return ((recur(source->left, target->left) && recur(source->right, target->right)) ||
            (recur(source->left, target->right) && recur(source->right, target->left)));
}
bool solve(Tree* source, Tree* target) {
    if (!source && !target) return true;
    if (!source || !target) return false;
    if (source->val == target->val) {
        return (recur(source, target) || solve(source, target->left) ||
                solve(source, target->right));
    } else {
        return (solve(source, target->left) || solve(source, target->right));
    }
}
                    


                        Solution in Java :

import java.util.*;

class Solution {
    public boolean solve(Tree source, Tree target) {
        if (target == null)
            return source == target;
        return isInv(source, target) || solve(source, target.left) || solve(source, target.right);
    }

    public boolean isInv(Tree s, Tree t) {
        if (s == null || t == null)
            return s == t;
        if (s.val != t.val)
            return false;
        return isInv(s.left, t.right) && isInv(s.right, t.left)
            || isInv(s.left, t.left) && isInv(s.right, t.right);
    }
}
                    


                        Solution in Python : 
                            
# class Tree:
#     def __init__(self, val, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def solve(self, source, target):
        if not source or not target:
            return not source and not target
        t = self.isSubtree(target, source)
        return t

    def isSubtree(self, s, t):
        def sametree(s, t):
            if not s or not t:
                return not s and not t
            elif s.val == t.val:
                return (sametree(s.left, t.left) and sametree(s.right, t.right)) or (
                    sametree(s.right, t.left) and sametree(s.left, t.right)
                )
            else:
                return False

        if not s:
            return False
        elif sametree(s, t):
            return True
        else:
            return self.isSubtree(s.right, t) or self.isSubtree(s.left, t)


View More Similar Problems

Polynomial Division

Consider a sequence, c0, c1, . . . , cn-1 , and a polynomial of degree 1 defined as Q(x ) = a * x + b. You must perform q queries on the sequence, where each query is one of the following two types: 1 i x: Replace ci with x. 2 l r: Consider the polynomial and determine whether is divisible by over the field , where . In other words, check if there exists a polynomial with integer coefficie

View Solution →

Costly Intervals

Given an array, your goal is to find, for each element, the largest subarray containing it whose cost is at least k. Specifically, let A = [A1, A2, . . . , An ] be an array of length n, and let be the subarray from index l to index r. Also, Let MAX( l, r ) be the largest number in Al. . . r. Let MIN( l, r ) be the smallest number in Al . . .r . Let OR( l , r ) be the bitwise OR of the

View Solution →

The Strange Function

One of the most important skills a programmer needs to learn early on is the ability to pose a problem in an abstract way. This skill is important not just for researchers but also in applied fields like software engineering and web development. You are able to solve most of a problem, except for one last subproblem, which you have posed in an abstract way as follows: Given an array consisting

View Solution →

Self-Driving Bus

Treeland is a country with n cities and n - 1 roads. There is exactly one path between any two cities. The ruler of Treeland wants to implement a self-driving bus system and asks tree-loving Alex to plan the bus routes. Alex decides that each route must contain a subset of connected cities; a subset of cities is connected if the following two conditions are true: There is a path between ever

View Solution →

Unique Colors

You are given an unrooted tree of n nodes numbered from 1 to n . Each node i has a color, ci. Let d( i , j ) be the number of different colors in the path between node i and node j. For each node i, calculate the value of sum, defined as follows: Your task is to print the value of sumi for each node 1 <= i <= n. Input Format The first line contains a single integer, n, denoti

View Solution →

Fibonacci Numbers Tree

Shashank loves trees and math. He has a rooted tree, T , consisting of N nodes uniquely labeled with integers in the inclusive range [1 , N ]. The node labeled as 1 is the root node of tree , and each node in is associated with some positive integer value (all values are initially ). Let's define Fk as the Kth Fibonacci number. Shashank wants to perform 22 types of operations over his tree, T

View Solution →