bst-typed 1.52.5 → 1.52.6

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

@@ -276,7 +276,7 @@ class BinaryTree extends base_1.IterableEntryBase {
      * @returns a boolean value.
      */
     isRealNodeOrNull(node) {
-        return this.isRealNode(node) || node === null;
+        return node === null || this.isRealNode(node);
     }
     /**
      * The function checks if a given node is equal to the NIL value.
@@ -1526,7 +1526,7 @@ class BinaryTree extends base_1.IterableEntryBase {
         if (includeNull)
             return this.isRealNodeOrNull(node);
         return this.isRealNode(node);
-    }, shouldProcessRoot = node => true) {
+    }, shouldProcessRoot = node => this.isRealNodeOrNull(node)) {
         beginRoot = this.ensureNode(beginRoot);
         if (!beginRoot)
             return [];

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "bst-typed",
-  "version": "1.52.5",
+  "version": "1.52.6",
   "description": "BST (Binary Search Tree). Javascript & Typescript Data Structure.",
   "main": "dist/index.js",
   "scripts": {
@@ -144,6 +144,6 @@
     "typescript": "^4.9.5"
   },
   "dependencies": {
-    "data-structure-typed": "^1.52.5"
+    "data-structure-typed": "^1.52.6"
   }
 }

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

@@ -335,7 +335,7 @@ export class BinaryTree<
    * @returns a boolean value.
    */
   isRealNodeOrNull(node: R | BTNKeyOrNodeOrEntry<K, V, NODE>): node is NODE | null {
-    return this.isRealNode(node) || node === null;
+    return node === null || this.isRealNode(node);
   }
 
   /**
@@ -1843,7 +1843,7 @@ export class BinaryTree<
       if (includeNull) return this.isRealNodeOrNull(node);
       return this.isRealNode(node);
     },
-    shouldProcessRoot: (node: OptBTNOrNull<NODE>) => boolean = node => true
+    shouldProcessRoot: (node: OptBTNOrNull<NODE>) => boolean = node => this.isRealNodeOrNull(node)
   ): ReturnType<C>[] {
     beginRoot = this.ensureNode(beginRoot);
     if (!beginRoot) return [];