avl-tree-typed 1.51.3 → 1.51.5

package/dist/data-structures/binary-tree/binary-tree.js

@@ -266,9 +266,9 @@ class BinaryTree extends base_1.IterableEntryBase {
      * @returns a boolean value.
      */
     isRealNode(node) {
-        if (!this.isNode(node))
+        if (node === this.NIL || node === null || node === undefined)
             return false;
-        return node !== this.NIL;
+        return this.isNode(node);
     }
     /**
      * The function checks if a given node is a BinaryTreeNode instance and has a key value of NaN.

package/dist/data-structures/binary-tree/bst.js

@@ -608,7 +608,7 @@ class BST extends binary_tree_1.BinaryTree {
         if (!current)
             return undefined;
         if (this._variant === 'STANDARD') {
-            // For BSTVariant.MIN, find the rightmost node
+            // For 'STANDARD', find the rightmost node
             while (current.right !== undefined) {
                 current = current.right;
             }

package/dist/data-structures/index.d.ts

@@ -4,9 +4,9 @@ export * from './stack';
 export * from './queue';
 export * from './graph';
 export * from './binary-tree';
-export * from './tree';
 export * from './heap';
 export * from './priority-queue';
 export * from './matrix';
 export * from './trie';
 export * from './base';
+export * from './tree';

package/dist/data-structures/index.js

@@ -20,9 +20,9 @@ __exportStar(require("./stack"), exports);
 __exportStar(require("./queue"), exports);
 __exportStar(require("./graph"), exports);
 __exportStar(require("./binary-tree"), exports);
-__exportStar(require("./tree"), exports);
 __exportStar(require("./heap"), exports);
 __exportStar(require("./priority-queue"), exports);
 __exportStar(require("./matrix"), exports);
 __exportStar(require("./trie"), exports);
 __exportStar(require("./base"), exports);
+__exportStar(require("./tree"), exports);

package/dist/utils/index.d.ts

@@ -1 +1,2 @@
 export * from './utils';
+export * from './number';

package/dist/utils/index.js

@@ -15,3 +15,4 @@ var __exportStar = (this && this.__exportStar) || function(m, exports) {
 };
 Object.defineProperty(exports, "__esModule", { value: true });
 __exportStar(require("./utils"), exports);
+__exportStar(require("./number"), exports);

package/dist/utils/number.d.ts

@@ -0,0 +1 @@
+export declare function toBinaryString(num: number, digit?: number): string;

package/dist/utils/number.js

@@ -0,0 +1,11 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.toBinaryString = void 0;
+function toBinaryString(num, digit = 32) {
+    // Convert number to binary string
+    let binaryString = (num >>> 0).toString(2); // Use the unsigned right shift operator to ensure you get a binary representation of a 32-bit unsigned integer
+    // Use pad Start to ensure the string length is 32 bits
+    binaryString = binaryString.padStart(digit, '0');
+    return binaryString;
+}
+exports.toBinaryString = toBinaryString;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "avl-tree-typed",
-  "version": "1.51.3",
+  "version": "1.51.5",
   "description": "AVLTree(Adelson-Velsky and Landis Tree). Javascript & Typescript Data Structure.",
   "main": "dist/index.js",
   "scripts": {
@@ -163,6 +163,6 @@
     "typescript": "^4.9.5"
   },
   "dependencies": {
-    "data-structure-typed": "^1.51.3"
+    "data-structure-typed": "^1.51.5"
   }
 }

package/src/data-structures/binary-tree/binary-tree.ts

@@ -316,8 +316,8 @@ export class BinaryTree<
    * @returns a boolean value.
    */
   isRealNode(node: KeyOrNodeOrEntry<K, V, NODE>): node is NODE {
-    if (!this.isNode(node)) return false;
-    return node !== this.NIL;
+    if (node === this.NIL || node === null || node === undefined) return false;
+    return this.isNode(node);
   }
 
   /**

package/src/data-structures/binary-tree/bst.ts

@@ -695,7 +695,7 @@ export class BST<
     if (!current) return undefined;
 
     if (this._variant === 'STANDARD') {
-      // For BSTVariant.MIN, find the rightmost node
+      // For 'STANDARD', find the rightmost node
       while (current.right !== undefined) {
         current = current.right;
       }

package/src/data-structures/index.ts

@@ -4,9 +4,9 @@ export * from './stack';
 export * from './queue';
 export * from './graph';
 export * from './binary-tree';
-export * from './tree';
 export * from './heap';
 export * from './priority-queue';
 export * from './matrix';
 export * from './trie';
 export * from './base';
+export * from './tree';

package/src/utils/index.ts

@@ -1 +1,2 @@
 export * from './utils';
+export * from './number';

package/src/utils/number.ts

@@ -0,0 +1,9 @@
+export function toBinaryString(num: number, digit = 32) {
+  // Convert number to binary string
+  let binaryString = (num >>> 0).toString(2); // Use the unsigned right shift operator to ensure you get a binary representation of a 32-bit unsigned integer
+
+  // Use pad Start to ensure the string length is 32 bits
+  binaryString = binaryString.padStart(digit, '0');
+
+  return binaryString;
+}