-
Notifications
You must be signed in to change notification settings - Fork 27
/
Copy path100. 相同的树.js
126 lines (114 loc) · 2.17 KB
/
100. 相同的树.js
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
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
/**
* Created by admin on 2018/10/12.
*/
/**给定两个二叉树,编写一个函数来检验它们是否相同。
* 如果两个树在结构上相同,并且节点具有相同的值,则认为它们是相同的。
*
* 输入: 1 1
* / \ / \
* 2 3 2 3
* [1,2,3], [1,2,3]
* 输出: true
*/
/**
* Definition for a binary tree node.
* function TreeNode(val) {
* this.val = val;
* this.left = this.right = null;
* }
*/
/**
* @param {TreeNode} p
* @param {TreeNode} q
* @return {boolean}
*/
var isSameTree = function (p, q) {
let isSame = true;
traversal(p, q);
function traversal(p, q) {
if (!isSame) return isSame;
if (p === null || q === null) {
if (p !== q) {
isSame = false;
}
return
}
if (p.val !== q.val) return isSame = false;
traversal(p.left, q.left);
traversal(p.right, q.right)
}
return isSame
};
var p = {
val: -10,
left: {
val: 9,
left: null,
right: null
},
right: {
val: 20,
left: {
val: 15,
left: null,
right: null
},
right: {
val: 7,
left: null,
right: null
}
}
};
var q = {
val: -10,
left: {
val: 9,
left: {
val: 5,
left: null,
right: null
},
right: null
},
right: {
val: 20,
left: {
val: 15,
left: null,
right: null
},
right: {
val: 7,
left: null,
right: {
val: 0,
left: null,
right: null
}
}
}
};
let test = [
{p, q},
{
p: null,
q: null
},
{
p: {
val: 0,
left: null,
right: null
},
q: {
val: 1,
left: null,
right: null
}
}
];
test.forEach((sample, i) => {
let result = isSameTree(sample.p, sample.q);
if (!result) console.log(`not same is ${i}`);
});