1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
import { TreeNode } from "../binary-tree-inorder-traversal/TreeNode.ts";import { assert } from "../deps.ts";import isSameTree from "./index.ts";
Deno.test("same-tree", () => {    const p = new TreeNode(1);    const q = new TreeNode(1);    assert(isSameTree(p, q));    assert(isSameTree(null, null));    assert(!isSameTree(null, p));    assert(!isSameTree(p, null));    assert(isSameTree(p, p));    assert(        !isSameTree(            {                val: 1,                left: { val: 2, left: null, right: null },                right: { val: 1, left: null, right: null },            },            {                val: 1,                left: { val: 1, left: null, right: null },                right: { val: 2, left: null, right: null },            },        ),    );    assert(        !isSameTree(            { val: 1, left: { val: 2, left: null, right: null }, right: null },            { val: 1, left: null, right: { val: 2, left: null, right: null } },        ),    );    assert(        isSameTree(            {                val: 1,                left: { val: 2, left: null, right: null },                right: { val: 3, left: null, right: null },            },            {                val: 1,                left: { val: 2, left: null, right: null },                right: { val: 3, left: null, right: null },            },        ),    );});