<p>This problem is not suit for F#. So I wrote modified version.</p>
<h2 id="heading-url">URL</h2>
<p><a href="https://leetcode.com/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/" class="autolinkedURL autolinkedURL-url" target="_blank">leetcode.com/problems/find-a-corresponding-..</a></p>
<h2 id="heading-code">Code</h2>
<p><a href="https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/problems/1379/main.fsx" class="autolinkedURL autolinkedURL-url" target="_blank">github.com/syohex/dotnet-study/blob/master/..</a></p>
<pre><code class="lang-fsharp">type Tree =
    | Leaf
    | Node of int * Tree * Tree

let rec getTargetCopy (original: Tree) (cloned: Tree) (target: int) : Tree =
    match original, cloned with
    | Leaf, Leaf -&gt; Leaf
    | Node (v1, left1, right1), Node (_, left2, right2) -&gt;
        if v1 = target then
            cloned
        else
            match getTargetCopy left1 left2 target with
            | Node (_, _, _) as r -&gt; r
            | Leaf -&gt; getTargetCopy right1 right2 target
    | _, _ -&gt; failwith "never reach here"
</code></pre>


This problem is not suit for F#. So I wrote modified version.

## URL

https://leetcode.com/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/

## Code

https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/problems/1379/main.fsx

```fsharp
type Tree =
    | Leaf
    | Node of int * Tree * Tree

let rec getTargetCopy (original: Tree) (cloned: Tree) (target: int) : Tree =
    match original, cloned with
    | Leaf, Leaf -> Leaf
    | Node (v1, left1, right1), Node (_, left2, right2) ->
        if v1 = target then
            cloned
        else
            match getTargetCopy left1 left2 target with
            | Node (_, _, _) as r -> r
            | Leaf -> getTargetCopy right1 right2 target
    | _, _ -> failwith "never reach here"
```

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

URL

Code