binary-tree-typed 2.4.3 → 2.4.4

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 (47) hide show
  1. package/dist/cjs/index.cjs +1 -1
  2. package/dist/cjs/index.cjs.map +1 -1
  3. package/dist/cjs-legacy/index.cjs +1 -1
  4. package/dist/cjs-legacy/index.cjs.map +1 -1
  5. package/dist/esm/index.mjs +1 -1
  6. package/dist/esm/index.mjs.map +1 -1
  7. package/dist/esm-legacy/index.mjs +1 -1
  8. package/dist/esm-legacy/index.mjs.map +1 -1
  9. package/dist/types/data-structures/base/iterable-element-base.d.ts +1 -1
  10. package/dist/types/data-structures/binary-tree/binary-tree.d.ts +5 -5
  11. package/dist/types/data-structures/binary-tree/bst.d.ts +1 -1
  12. package/dist/types/data-structures/graph/directed-graph.d.ts +2 -2
  13. package/dist/types/data-structures/graph/undirected-graph.d.ts +2 -2
  14. package/dist/types/data-structures/hash/hash-map.d.ts +2 -2
  15. package/dist/types/data-structures/heap/heap.d.ts +3 -7
  16. package/dist/types/types/data-structures/binary-tree/avl-tree.d.ts +1 -1
  17. package/dist/types/types/data-structures/binary-tree/red-black-tree.d.ts +1 -1
  18. package/dist/types/types/data-structures/linked-list/doubly-linked-list.d.ts +1 -1
  19. package/dist/types/types/data-structures/linked-list/singly-linked-list.d.ts +1 -1
  20. package/dist/types/types/data-structures/priority-queue/priority-queue.d.ts +1 -1
  21. package/dist/types/types/data-structures/stack/stack.d.ts +1 -1
  22. package/dist/umd/binary-tree-typed.js +1 -1
  23. package/dist/umd/binary-tree-typed.js.map +1 -1
  24. package/dist/umd/binary-tree-typed.min.js +1 -1
  25. package/dist/umd/binary-tree-typed.min.js.map +1 -1
  26. package/package.json +2 -2
  27. package/src/data-structures/base/iterable-element-base.ts +2 -2
  28. package/src/data-structures/binary-tree/binary-tree.ts +8 -7
  29. package/src/data-structures/binary-tree/bst.ts +1 -1
  30. package/src/data-structures/binary-tree/tree-multi-set.ts +5 -5
  31. package/src/data-structures/graph/abstract-graph.ts +18 -18
  32. package/src/data-structures/graph/directed-graph.ts +4 -4
  33. package/src/data-structures/graph/map-graph.ts +1 -1
  34. package/src/data-structures/graph/undirected-graph.ts +4 -4
  35. package/src/data-structures/hash/hash-map.ts +6 -4
  36. package/src/data-structures/heap/heap.ts +17 -14
  37. package/src/data-structures/linked-list/doubly-linked-list.ts +4 -4
  38. package/src/data-structures/linked-list/singly-linked-list.ts +15 -9
  39. package/src/data-structures/queue/deque.ts +1 -1
  40. package/src/data-structures/stack/stack.ts +1 -1
  41. package/src/data-structures/trie/trie.ts +10 -5
  42. package/src/types/data-structures/binary-tree/avl-tree.ts +1 -1
  43. package/src/types/data-structures/binary-tree/red-black-tree.ts +1 -1
  44. package/src/types/data-structures/linked-list/doubly-linked-list.ts +1 -1
  45. package/src/types/data-structures/linked-list/singly-linked-list.ts +1 -1
  46. package/src/types/data-structures/priority-queue/priority-queue.ts +1 -1
  47. package/src/types/data-structures/stack/stack.ts +1 -1
@@ -2443,7 +2443,7 @@ var BinaryTree = class extends IterableEntryBase {
2443
2443
  * @param node - The node.
2444
2444
  * @returns The node's key or undefined.
2445
2445
  */
2446
- _DEFAULT_NODE_CALLBACK = /* @__PURE__ */ __name((node) => node ? node.key : void 0, "_DEFAULT_NODE_CALLBACK");
2446
+ _DEFAULT_NODE_CALLBACK = /* @__PURE__ */ __name((node) => node?.key, "_DEFAULT_NODE_CALLBACK");
2447
2447
  /**
2448
2448
  * (Protected) Snapshots the current tree's configuration options.
2449
2449
  * @remarks Time O(1)