Let Code Day45 Starting from Zero "1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree"

Overview

It seems that coding tests are conducted overseas in interviews with engineers, and in many cases, the main thing is to implement specific functions and classes according to the theme.

As a countermeasure, it seems that a site called Let Code will take measures.

A site that trains algorithmic power that can withstand coding tests that are often done in the home.

I think it's better to have the algorithm power of a human being, so I'll solve the problem irregularly and write down the method I thought at that time as a memo.

Leetcode

Leet Code Table of Contents Starting from Zero

Last time Leet Code Day 44 "543. Diameter of Binary Tree" starting from zero

Right now, I'm prioritizing the Medium of the Top 100 Liked Questions. I solved all Easy, so if you are interested, please go to the table of contents.

Twitter I'm doing it.

problem

1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree

The difficulty level is Medium.

Given two binary trees, ʻoriginal and cloned, a reference to target of ʻoriginal is given.

The duplicated tree is a copy of the original tree and returns a reference to the same node in the duplicated tree. You are not allowed to modify the two trees or the target and the answer must be a reference to a node in the cloned tree.

Follow-up: If the tree allows repeat values, resolve the issue.

solution

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def getTargetCopy(self, original: TreeNode, cloned: TreeNode, target: TreeNode) -> TreeNode:
        if not original:
            return None
        if original == target:
            return cloned
        
        return self.getTargetCopy(original.left,cloned.left,target) or self.getTargetCopy(original.right,cloned.right,target)
# Runtime: 672 ms, faster than 60.93% of Python3 online submissions for Find a Corresponding Node of a Binary Tree in a Clone of That Tree.
# Memory Usage: 23.5 MB, less than 100.00% of Python3 online submissions for Find a Corresponding Node of a Binary Tree in a Clone of That Tree.

I solved it as above. I thought it was a relatively good answer because I could write it simply, but I didn't get that much speed, so I looked up other answers.

class Solution:
    def getTargetCopy(self, original: TreeNode, cloned: TreeNode, target: TreeNode) -> TreeNode:
        que = collections.deque([(original, cloned)]) # start at the root
        while que:
            nodeOrig, nodeClon = que.popleft()
            if nodeOrig is target: # if original node is found - cloned node is our answer
                return nodeClon
            if nodeOrig.left:  que.append((nodeOrig.left, nodeClon.left))
            if nodeOrig.right: que.append((nodeOrig.right, nodeClon.right))
# Runtime: 656 ms, faster than 92.51% of Python3 online submissions for Find a Corresponding Node of a Binary Tree in a Clone of That Tree.
# Memory Usage: 23.6 MB, less than 100.00% of Python3 online submissions for Find a Corresponding Node of a Binary Tree in a Clone of That Tree.

https://leetcode.com/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/discuss/539484/Simple-clean-and-fast-Python-solution-7-lines-beats-92

This answer is written using que, but it should be easy to understand. The speed is perfect, and instead of forcing the problem into a type that you can solve, if you can learn how to answer like this and switch, it will be fun to solve the problem more!

Up to here for this time. Thank you for your hard work.

Recommended Posts

Let Code Day45 Starting from Zero "1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree"
Let Code Day 44 "543. Diameter of Binary Tree" starting from zero
Let Code Day7 starting from zero "104. Maximum Depth of Binary Tree"
Let Code Day83 Starting from Zero "102. Binary Tree Level Order Traversal"
Let Code Day54 Starting from Zero "1290. Convert Binary Number in a Linked List to Integer"
Let Code Day 40 Starting from Zero "114. Flatten Binary Tree to Linked List"
Let Code Day 91 "153. Find Minimum in Rotated Sorted Array" starting from zero
Let Code Day 9 "701. Insert into a Binary Search Tree" starting from scratch
Let Code Day59 starting from zero "1221. Split a String in Balanced Strings"
Let Code Day 66 "438. Find All Anagrams in a String" starting from scratch
Let Code Day6 Starting from Zero "1342. Number of Steps to Reduce a Number to Zero"
Let Code Day 23 "226. Invert Binary Tree" starting from scratch
Let Code Day52 Starting from Zero "1351. Count Negative Numbers in a Sorted Matrix"
Let Code Day21 Starting from Zero "448. Find All Numbers Disappeared in an Array"
Let Code Day 37 Starting from Zero "105. Construct Binary Tree from Preorder and Inorder Traversal"
Let Code Day 26 starting from scratch "94. Binary Tree Inorder Traversal"
Let Code Day 64 starting from zero "287. Find the Duplicate Number"
Let Code Day12 Starting from Zero "617. Merge Two Binary Trees"
Let Code Day70 Starting from Zero "295. Find Median from Data Stream"
Let Code Day87 Starting from Zero "1512. Number of Good Pairs"
Let Code Day67 Starting from Zero "1486. XOR Operation in an Array"
Let Code Day56 Starting from Zero "5453. Running Sum of 1d Array"
Let Code Day86 Starting from Zero "33. Search in Rotated Sorted Array"
Let Code Day92 Starting from Zero "4. Median of Two Sorted Arrays"
Let Code Day 35 "160. Intersection of Two Linked Lists" Starting from Zero
Let Code Day72 Starting from Zero "1498. Number of Subsequences That Satisfy the Given Sum Condition"
Let Code Day58 Starting from Zero "20. Valid Parentheses"
Let Code Day 27 "101. Symmetric Tree" starting from scratch
Let Code Day16 Starting from Zero "344. Reverse String"
Let Code Day49 starting from zero "1323. Maximum 69 Number"
Let Code Day89 "62. Unique Paths" Starting from Zero
Let Code Day 55 "22. Generate Parentheses" Starting from Zero
Let Code Table of Contents Starting from Zero
Let Code Day18 starting from zero "53. Maximum Subarray"
Let Code Day 80 "703. Kth Largest Element in a Stream" starting from scratch
Let Code Day 13 "338. Counting Bits" Starting from Zero
Let Code Day71 Starting from Zero "1496. Path Crossing"
Let Code Day 61 "7. Reverse Integer" starting from zero
Let Code Day 82 "392. Is Subsequence" Starting from Zero
Let Code Day51 Starting from Zero "647. Palindromic Substrings"
Let Code Day 50 "739. Daily Temperatures" Starting from Zero
Let Code Day 11 Starting from Zero "1315. Sum of Nodes with Even-Valued Grandparent"
Let Code Day 15 "283. Move Zeroes" starting from zero
Let Code Day14 starting from zero "136. Single Number"
Let Code Day1 Starting from Zero "1389. Create Target Array in the Given Order"
Let Code Day10 Starting from Zero "1431. Kids With the Greatest Number of Candies"
Let Code Day 43 "5. Longest Palindromic Substring" Starting from Zero
Let Code Day74 starting from zero "12. Integer to Roman"
Let Code Day 42 "2. Add Two Numbers" Starting from Zero
Let Code Day57 Starting from Zero "35. Search Insert Position"
Let Code Day47 Starting from Zero "14. Longest Common Prefix"
Let Code Day78 Starting from Zero "206. Reverse Linked List"
Let Code Day 60 starting from zero "1481. Least Number of Unique Integers after K Removals"
Let Code Day 84 starting from zero "142. Linked List Cycle II"
Let Code Day24 Starting from Zero "21. Merge Two Sorted Lists"
Let Code Day2 Starting from Zero "1108. Defanging an IP Address"
Let Code Day 38 starting from scratch "208. Implement Trie (Prefix Tree)"
Let Code Day81 "347. Top K Frequent Elements" Starting from Zero
Let Code Day4 starting from scratch "938. Range Sum of BST"
Let Code Day48 Starting from Zero "26. Remove Duplicates from Sorted Array"
Let Code Day5 starting from zero "1266. Minimum Time Visiting All Points"