We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent c89f245 commit 7987873Copy full SHA for 7987873
1359.验证二叉树.js
@@ -0,0 +1,30 @@
1
+/**
2
+ * @param {number} n
3
+ * @param {number[]} leftChild
4
+ * @param {number[]} rightChild
5
+ * @return {boolean}
6
+ */
7
+var validateBinaryTreeNodes = function(n, leftChild, rightChild) {
8
+ const queue = [0];
9
+ const set = new Set(queue);
10
+
11
+ while (queue.length) {
12
+ const i = queue.shift();
13
14
+ if (set.has(leftChild[i])) {
15
+ return false;
16
+ } else if (leftChild[i] !== -1) {
17
+ set.add(leftChild[i]);
18
+ queue.push(leftChild[i]);
19
+ }
20
21
+ if (set.has(rightChild[i])) {
22
23
+ } else if (rightChild[i] !== -1) {
24
+ set.add(rightChild[i]);
25
+ queue.push(rightChild[i]);
26
27
28
29
+ return set.size === n;
30
+};
0 commit comments