binary-tree-typed 2.4.5 → 2.5.1

package/README.md

@@ -34,90 +34,6 @@ yarn add binary-tree-typed
 
 [//]: # (No deletion!!! Start of Example Replace Section)
 
-### basic BinaryTree creation and insertion
-```typescript
- // Create a BinaryTree with entries
-    const entries: [number, string][] = [
-      [6, 'six'],
-      [1, 'one'],
-      [2, 'two'],
-      [7, 'seven'],
-      [5, 'five'],
-      [3, 'three'],
-      [4, 'four'],
-      [9, 'nine'],
-      [8, 'eight']
-    ];
-
-    const tree = new BinaryTree(entries);
-
-    // Verify size
-    console.log(tree.size); // 9;
-
-    // Add new element
-    tree.set(10, 'ten');
-    console.log(tree.size); // 10;
-```
-
-### BinaryTree get and has operations
-```typescript
- const tree = new BinaryTree(
-      [
-        [5, 'five'],
-        [3, 'three'],
-        [7, 'seven'],
-        [1, 'one'],
-        [4, 'four'],
-        [6, 'six'],
-        [8, 'eight']
-      ],
-      { isMapMode: false }
-    );
-
-    // Check if key exists
-    console.log(tree.has(5)); // true;
-    console.log(tree.has(10)); // false;
-
-    // Get value by key
-    console.log(tree.get(3)); // 'three';
-    console.log(tree.get(7)); // 'seven';
-    console.log(tree.get(100)); // undefined;
-
-    // Get node structure
-    const node = tree.getNode(5);
-    console.log(node?.key); // 5;
-    console.log(node?.value); // 'five';
-```
-
-### BinaryTree level-order traversal
-```typescript
- const tree = new BinaryTree([
-      [1, 'one'],
-      [2, 'two'],
-      [3, 'three'],
-      [4, 'four'],
-      [5, 'five'],
-      [6, 'six'],
-      [7, 'seven']
-    ]);
-
-    // Binary tree maintains level-order insertion
-    // Complete binary tree structure
-    console.log(tree.size); // 7;
-
-    // Verify all keys are present
-    console.log(tree.has(1)); // true;
-    console.log(tree.has(4)); // true;
-    console.log(tree.has(7)); // true;
-
-    // Iterate through tree
-    const keys: number[] = [];
-    for (const [key] of tree) {
-      keys.push(key);
-    }
-    console.log(keys.length); // 7;
-```
-
 ### determine loan approval using a decision tree
 ```typescript
  // Decision tree structure