linked-list-typed 1.49.7 → 1.49.8

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (7) hide show
  1. package/dist/data-structures/binary-tree/binary-tree.js +4 -4
  2. package/dist/data-structures/binary-tree/rb-tree.js +2 -2
  3. package/dist/types/data-structures/binary-tree/rb-tree.d.ts +1 -1
  4. package/package.json +2 -2
  5. package/src/data-structures/binary-tree/binary-tree.ts +4 -4
  6. package/src/data-structures/binary-tree/rb-tree.ts +1 -2
  7. package/src/types/data-structures/binary-tree/rb-tree.ts +1 -1
package/dist/data-structures/binary-tree/binary-tree.js CHANGED
@@ -1205,9 +1205,9 @@ class BinaryTree extends base_1.IterableEntryBase {
1205
1205
  queue.push(current.right);
1206
1206
  }
1207
1207
  else {
1208
- if (current.left)
1208
+ if (this.isRealNode(current.left))
1209
1209
  queue.push(current.left);
1210
- if (current.right)
1210
+ if (this.isRealNode(current.right))
1211
1211
  queue.push(current.right);
1212
1212
  }
1213
1213
  traverse(level + 1);
@@ -1228,9 +1228,9 @@ class BinaryTree extends base_1.IterableEntryBase {
1228
1228
  queue.push(current.right);
1229
1229
  }
1230
1230
  else {
1231
- if (current.left)
1231
+ if (this.isRealNode(current.left))
1232
1232
  queue.push(current.left);
1233
- if (current.right)
1233
+ if (this.isRealNode(current.right))
1234
1234
  queue.push(current.right);
1235
1235
  }
1236
1236
  }
package/dist/data-structures/binary-tree/rb-tree.js CHANGED
@@ -73,7 +73,7 @@ class RedBlackTree extends bst_1.BST {
73
73
  * @returns a new instance of a RedBlackTree object.
74
74
  */
75
75
  createTree(options) {
76
- return new RedBlackTree([], Object.assign({ iterationType: this.iterationType, variant: this.variant }, options));
76
+ return new RedBlackTree([], Object.assign({ iterationType: this.iterationType }, options));
77
77
  }
78
78
  /**
79
79
  * The function `exemplarToNode` takes an keyOrNodeOrEntry and converts it into a node object if possible.
@@ -273,9 +273,9 @@ class RedBlackTree extends bst_1.BST {
273
273
  this._fixDelete(x);
274
274
  }
275
275
  this._size--;
276
+ ans.push({ deleted: z, needBalanced: undefined });
276
277
  };
277
278
  helper(this.root);
278
- // TODO
279
279
  return ans;
280
280
  }
281
281
  /**
package/dist/types/data-structures/binary-tree/rb-tree.d.ts CHANGED
@@ -6,4 +6,4 @@ export declare enum RBTNColor {
6
6
  }
7
7
  export type RedBlackTreeNodeNested<K, V> = RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, RedBlackTreeNode<K, V, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>;
8
8
  export type RedBlackTreeNested<K, V, N extends RedBlackTreeNode<K, V, N>> = RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>;
9
- export type RBTreeOptions<K> = BSTOptions<K> & {};
9
+ export type RBTreeOptions<K> = Omit<BSTOptions<K>, 'variant'> & {};
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "linked-list-typed",
3
- "version": "1.49.7",
3
+ "version": "1.49.8",
4
4
  "description": "Linked List, Doubly Linked List, Singly Linked List. Javascript & Typescript Data Structure.",
5
5
  "main": "dist/index.js",
6
6
  "scripts": {
@@ -66,6 +66,6 @@
66
66
  "typescript": "^4.9.5"
67
67
  },
68
68
  "dependencies": {
69
- "data-structure-typed": "^1.49.7"
69
+ "data-structure-typed": "^1.49.8"
70
70
  }
71
71
  }
package/src/data-structures/binary-tree/binary-tree.ts CHANGED
@@ -1509,8 +1509,8 @@ export class BinaryTree<
1509
1509
  if (current && this.isNodeOrNull(current.left)) queue.push(current.left);
1510
1510
  if (current && this.isNodeOrNull(current.right)) queue.push(current.right);
1511
1511
  } else {
1512
- if (current.left) queue.push(current.left);
1513
- if (current.right) queue.push(current.right);
1512
+ if (this.isRealNode(current.left)) queue.push(current.left);
1513
+ if (this.isRealNode(current.right)) queue.push(current.right);
1514
1514
  }
1515
1515
 
1516
1516
  traverse(level + 1);
@@ -1530,8 +1530,8 @@ export class BinaryTree<
1530
1530
  if (current && this.isNodeOrNull(current.left)) queue.push(current.left);
1531
1531
  if (current && this.isNodeOrNull(current.right)) queue.push(current.right);
1532
1532
  } else {
1533
- if (current.left) queue.push(current.left);
1534
- if (current.right) queue.push(current.right);
1533
+ if (this.isRealNode(current.left)) queue.push(current.left);
1534
+ if (this.isRealNode(current.right)) queue.push(current.right);
1535
1535
  }
1536
1536
  }
1537
1537
  }
package/src/data-structures/binary-tree/rb-tree.ts CHANGED
@@ -106,7 +106,6 @@ export class RedBlackTree<
106
106
  override createTree(options?: RBTreeOptions<K>): TREE {
107
107
  return new RedBlackTree<K, V, N, TREE>([], {
108
108
  iterationType: this.iterationType,
109
- variant: this.variant,
110
109
  ...options
111
110
  }) as TREE;
112
111
  }
@@ -316,9 +315,9 @@ export class RedBlackTree<
316
315
  this._fixDelete(x!);
317
316
  }
318
317
  this._size--;
318
+ ans.push({ deleted: z, needBalanced: undefined });
319
319
  };
320
320
  helper(this.root);
321
- // TODO
322
321
  return ans;
323
322
  }
324
323
 
package/src/types/data-structures/binary-tree/rb-tree.ts CHANGED
@@ -7,4 +7,4 @@ export type RedBlackTreeNodeNested<K, V> = RedBlackTreeNode<K, V, RedBlackTreeNo
7
7
 
8
8
  export type RedBlackTreeNested<K, V, N extends RedBlackTreeNode<K, V, N>> = RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
9
9
 
10
- export type RBTreeOptions<K> = BSTOptions<K> & {};
10
+ export type RBTreeOptions<K> = Omit<BSTOptions<K>, 'variant'> & {};