Thanks to visit codestin.com Credit goes to github.com
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.
2 parents 45de167 + 2aded16 commit 53256efCopy full SHA for 53256ef
src/data-structures/binary-search-tree.js
@@ -455,7 +455,7 @@
455
if (!root) {
456
return false;
457
}
458
- if (node === root.value) {
+ if (node.value === root.value) {
459
return true;
460
461
return this._existsInSubtree(node, root._left) ||
src/data-structures/linked-list.js
@@ -235,13 +235,15 @@
235
return;
236
237
inverse(next, next.next);
238
+ next.prev = next.next;
239
next.next = current;
240
241
242
if (!this.first) {
243
244
245
inverse(this.first, this.first.next);
246
+ this.first.prev = this.first.next;
247
this.first.next = null;
248
var temp = this.first;
249
this.first = this.last;
0 commit comments