x/data-structure-typed
1
0
Fork 0
mirror of https://github.com/zrwusa/data-structure-typed.git synced 2024-11-14 09:24:05 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

fix: #110

Browse source
This commit is contained in:
Revone 2024-10-31 13:20:00 +13:00
parent 5992ae5d0d
commit 761c1c6af4
1 changed files with 3 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
src/data-structures/binary-tree/binary-tree.ts
View file

@ -515,7 +515,7 @@ export class BinaryTree<
*
* The function `delete` in TypeScript implements the deletion of a node in a binary tree and returns
* the deleted node along with information for tree balancing.
* @param {BTNKeyOrNodeOrEntry<K, V, NODE> | R | BTNPredicate<NODE>} keyOrNodeOrEntryOrRawOrPredicate
* @param {BTNKeyOrNodeOrEntry<K, V, NODE> | R} keyOrNodeOrEntryOrRawOr
* - The `delete` method you provided is used to delete a node from a binary tree based on the key,
* node, entry, raw data, or a custom predicate. The method returns an array of
* `BinaryTreeDeleteResult` objects containing information about the deleted node and whether
@ -525,12 +525,12 @@ export class BinaryTree<
* need to be balanced (`needBalanced`).
*/
delete(
keyOrNodeOrEntryOrRawOrPredicate: BTNKeyOrNodeOrEntry<K, V, NODE> | R | BTNPredicate<NODE>
keyOrNodeOrEntryOrRawOr: BTNKeyOrNodeOrEntry<K, V, NODE> | R
): BinaryTreeDeleteResult<NODE>[] {
const deletedResult: BinaryTreeDeleteResult<NODE>[] = [];
if (!this._root) return deletedResult;
const curr = this.getNode(keyOrNodeOrEntryOrRawOrPredicate);
const curr = this.getNode(keyOrNodeOrEntryOrRawOr);
if (!curr) return deletedResult;
const parent: NODE | undefined = curr?.parent;