data-structure-typed 1.34.6 → 1.34.8

package/CHANGELOG.md

@@ -8,7 +8,7 @@ All notable changes to this project will be documented in this file.
 - [Semantic Versioning](https://semver.org/spec/v2.0.0.html)
 - [`auto-changelog`](https://github.com/CookPete/auto-changelog)
 
-## [v1.34.6](https://github.com/zrwusa/data-structure-typed/compare/v1.34.1...main) (upcoming)
+## [v1.34.8](https://github.com/zrwusa/data-structure-typed/compare/v1.34.1...main) (upcoming)
 
 ## [v1.34.1](https://github.com/zrwusa/data-structure-typed/compare/v1.33.4...v1.34.1) (6 October 2023)
 

package/README.md

@@ -6,13 +6,15 @@ Do you envy C++ with [std](), Python with [collections](), and Java with [java.u
 
 Now you can use this library in Node.js and browser environments in CommonJS(require export.modules = ), ESModule(import export), Typescript(import export), UMD(var Queue = dataStructureTyped.Queue)
 
-The size after packaging is 69 kB.
-
-![License](https://img.shields.io/badge/License-MIT-blue.svg)
-![Language](https://img.shields.io/github/languages/top/zrwusa/data-structure-typed)
-![GitHub release (latest by date)](https://img.shields.io/github/v/release/zrwusa/data-structure-typed)
-![npm](https://aleen42.github.io/badges/src/npm.svg)
+![NPM](https://img.shields.io/npm/l/data-structure-typed)
+![GitHub top language](https://img.shields.io/github/languages/top/zrwusa/data-structure-typed)
+![npm](https://img.shields.io/npm/dw/data-structure-typed)
 ![eslint](https://aleen42.github.io/badges/src/eslint.svg)
+![npm package minimized gzipped size (select exports)](https://img.shields.io/bundlejs/size/data-structure-typed)
+![npm bundle size](https://img.shields.io/bundlephobia/min/data-structure-typed)
+![npm](https://img.shields.io/npm/v/data-structure-typed)
+
+
 
 [//]: # (![Branches](https://img.shields.io/badge/branches-55.47%25-red.svg?style=flat))
 
@@ -424,6 +426,7 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D
 
 ### Standard library data structure comparison
 
+
 <table>
   <thead>
   <tr>
@@ -449,6 +452,13 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D
     <td>LinkedList&lt;E&gt;</td>
     <td>deque</td>
   </tr>
+  <tr>
+    <td>Singly Linked List</td>
+    <td>SinglyLinkedList&lt;E&gt;</td>
+    <td>-</td>
+    <td>-</td>
+    <td>-</td>
+  </tr>
   <tr>
     <td>Set</td>
     <td>Set&lt;E&gt;</td>
@@ -464,19 +474,13 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D
     <td>dict</td>
   </tr>
   <tr>
-    <td>Unordered Set</td>
+    <td>Ordered Dictionary</td>
+    <td>Map&lt;K, V&gt;</td>
     <td>-</td>
-    <td>unordered_set&lt;T&gt;</td>
-    <td>HashSet&lt;E&gt;</td>
     <td>-</td>
+    <td>OrderedDict</td>
   </tr>
-  <tr>
-    <td>Unordered Map</td>
-    <td>HashMap&lt;K, V&gt;</td>
-    <td>unordered_map&lt;K, V&gt;</td>
-    <td>HashMap&lt;K, V&gt;</td>
-    <td>defaultdict</td>
-  </tr>
+
   <tr>
     <td>Queue</td>
     <td>Queue&lt;E&gt;</td>
@@ -491,6 +495,13 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D
     <td>PriorityQueue&lt;E&gt;</td>
     <td>-</td>
   </tr>
+  <tr>
+    <td>Heap</td>
+    <td>Heap&lt;V&gt;</td>
+    <td>priority_queue&lt;T&gt;</td>
+    <td>PriorityQueue&lt;E&gt;</td>
+    <td>heapq</td>
+  </tr>
   <tr>
     <td>Stack</td>
     <td>Stack&lt;E&gt;</td>
@@ -499,19 +510,26 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D
     <td>-</td>
   </tr>
   <tr>
-    <td>Bitset</td>
-    <td>-</td>
-    <td>bitset&lt;N&gt;</td>
+    <td>Deque</td>
+    <td>Deque&lt;E&gt;</td>
+    <td>deque&lt;T&gt;</td>
     <td>-</td>
     <td>-</td>
   </tr>
   <tr>
-    <td>Deque</td>
-    <td>Deque&lt;E&gt;</td>
-    <td>deque&lt;T&gt;</td>
+    <td>Trie</td>
+    <td>Trie</td>
+    <td>-</td>
     <td>-</td>
     <td>-</td>
   </tr>
+  <tr>
+    <td>Unordered Map</td>
+    <td>HashMap&lt;K, V&gt;</td>
+    <td>unordered_map&lt;K, V&gt;</td>
+    <td>HashMap&lt;K, V&gt;</td>
+    <td>defaultdict</td>
+  </tr>
   <tr>
     <td>Multiset</td>
     <td>-</td>
@@ -527,18 +545,39 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D
     <td>-</td>
   </tr>
   <tr>
-    <td>Unordered Multiset</td>
+    <td>Binary Tree</td>
+    <td>BinaryTree&lt;K, V&gt;</td>
+    <td>-</td>
     <td>-</td>
-    <td>unordered_multiset</td>
-    <td>Counter</td>
     <td>-</td>
   </tr>
   <tr>
-    <td>Ordered Dictionary</td>
-    <td>Map&lt;K, V&gt;</td>
+    <td>Binary Search Tree</td>
+    <td>BST&lt;K, V&gt;</td>
     <td>-</td>
     <td>-</td>
-    <td>OrderedDict</td>
+    <td>-</td>
+  </tr>
+  <tr>
+    <td>Directed Graph</td>
+    <td>DirectedGraph&lt;V, E&gt;</td>
+    <td>-</td>
+    <td>-</td>
+    <td>-</td>
+  </tr>
+  <tr>
+    <td>Undirected Graph</td>
+    <td>UndirectedGraph&lt;V, E&gt;</td>
+    <td>-</td>
+    <td>-</td>
+    <td>-</td>
+  </tr>
+  <tr>
+    <td>Unordered Multiset</td>
+    <td>-</td>
+    <td>unordered_multiset</td>
+    <td>-</td>
+    <td>Counter</td>
   </tr>
   <tr>
     <td>Linked Hash Set</td>
@@ -576,24 +615,24 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D
     <td>-</td>
   </tr>
   <tr>
-    <td>Persistent Collections</td>
-    <td>-</td>
+    <td>Unordered Multimap</td>
     <td>-</td>
+    <td>unordered_multimap&lt;K, V&gt;</td>
     <td>-</td>
     <td>-</td>
   </tr>
   <tr>
-    <td>unordered multiset</td>
+    <td>Bitset</td>
     <td>-</td>
-    <td>unordered_multiset&lt;T&gt;</td>
+    <td>bitset&lt;N&gt;</td>
     <td>-</td>
     <td>-</td>
   </tr>
   <tr>
-    <td>Unordered Multimap</td>
-    <td>unordered_multimap&lt;K, V&gt;</td>
-    <td>-</td>
+    <td>Unordered Set</td>
     <td>-</td>
+    <td>unordered_set&lt;T&gt;</td>
+    <td>HashSet&lt;E&gt;</td>
     <td>-</td>
   </tr>
   </tbody>

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

@@ -20,17 +20,17 @@ exports.AbstractBinaryTree = exports.AbstractBinaryTreeNode = void 0;
 var utils_1 = require("../../utils");
 var types_1 = require("../../types");
 var AbstractBinaryTreeNode = (function () {
-    function AbstractBinaryTreeNode(id, val) {
+    function AbstractBinaryTreeNode(key, val) {
         this._height = 0;
-        this._id = id;
+        this._key = key;
         this._val = val;
     }
-    Object.defineProperty(AbstractBinaryTreeNode.prototype, "id", {
+    Object.defineProperty(AbstractBinaryTreeNode.prototype, "key", {
         get: function () {
-            return this._id;
+            return this._key;
         },
         set: function (v) {
-            this._id = v;
+            this._key = v;
         },
         enumerable: false,
         configurable: true
@@ -135,7 +135,7 @@ var AbstractBinaryTree = (function () {
         this._root = null;
         this._size = 0;
         this._loopType = types_1.LoopType.ITERATIVE;
-        this._visitedId = [];
+        this._visitedKey = [];
         this._visitedVal = [];
         this._visitedNode = [];
         if (options !== undefined) {
@@ -165,9 +165,9 @@ var AbstractBinaryTree = (function () {
         enumerable: false,
         configurable: true
     });
-    Object.defineProperty(AbstractBinaryTree.prototype, "visitedId", {
+    Object.defineProperty(AbstractBinaryTree.prototype, "visitedKey", {
         get: function () {
-            return this._visitedId;
+            return this._visitedKey;
         },
         enumerable: false,
         configurable: true
@@ -187,14 +187,14 @@ var AbstractBinaryTree = (function () {
         configurable: true
     });
     AbstractBinaryTree.prototype.swapLocation = function (srcNode, destNode) {
-        var id = destNode.id, val = destNode.val, height = destNode.height;
-        var tempNode = this.createNode(id, val);
+        var key = destNode.key, val = destNode.val, height = destNode.height;
+        var tempNode = this.createNode(key, val);
         if (tempNode) {
             tempNode.height = height;
-            destNode.id = srcNode.id;
+            destNode.key = srcNode.key;
             destNode.val = srcNode.val;
             destNode.height = srcNode.height;
-            srcNode.id = tempNode.id;
+            srcNode.key = tempNode.key;
             srcNode.val = tempNode.val;
             srcNode.height = tempNode.height;
         }
@@ -208,14 +208,14 @@ var AbstractBinaryTree = (function () {
     AbstractBinaryTree.prototype.isEmpty = function () {
         return this.size === 0;
     };
-    AbstractBinaryTree.prototype.add = function (idOrNode, val) {
+    AbstractBinaryTree.prototype.add = function (keyOrNode, val) {
         var _this = this;
         var _bfs = function (root, newNode) {
             var queue = [root];
             while (queue.length > 0) {
                 var cur = queue.shift();
                 if (cur) {
-                    if (newNode && cur.id === newNode.id)
+                    if (newNode && cur.key === newNode.key)
                         return;
                     var inserted_1 = _this._addTo(newNode, cur);
                     if (inserted_1 !== undefined)
@@ -231,19 +231,19 @@ var AbstractBinaryTree = (function () {
             return;
         };
         var inserted, needInsert;
-        if (idOrNode === null) {
+        if (keyOrNode === null) {
             needInsert = null;
         }
-        else if (typeof idOrNode === 'number') {
-            needInsert = this.createNode(idOrNode, val);
+        else if (typeof keyOrNode === 'number') {
+            needInsert = this.createNode(keyOrNode, val);
         }
-        else if (idOrNode instanceof AbstractBinaryTreeNode) {
-            needInsert = idOrNode;
+        else if (keyOrNode instanceof AbstractBinaryTreeNode) {
+            needInsert = keyOrNode;
         }
         else {
             return;
         }
-        var existNode = idOrNode ? this.get(idOrNode, 'id') : undefined;
+        var existNode = keyOrNode ? this.get(keyOrNode, 'key') : undefined;
         if (this.root) {
             if (existNode) {
                 existNode.val = val;
@@ -268,17 +268,17 @@ var AbstractBinaryTree = (function () {
     AbstractBinaryTree.prototype.addMany = function (idsOrNodes, data) {
         var inserted = [];
         for (var i = 0; i < idsOrNodes.length; i++) {
-            var idOrNode = idsOrNodes[i];
-            if (idOrNode instanceof AbstractBinaryTreeNode) {
-                inserted.push(this.add(idOrNode.id, idOrNode.val));
+            var keyOrNode = idsOrNodes[i];
+            if (keyOrNode instanceof AbstractBinaryTreeNode) {
+                inserted.push(this.add(keyOrNode.key, keyOrNode.val));
                 continue;
             }
-            if (idOrNode === null) {
+            if (keyOrNode === null) {
                 inserted.push(this.add(null));
                 continue;
             }
             var val = data === null || data === void 0 ? void 0 : data[i];
-            inserted.push(this.add(idOrNode, val));
+            inserted.push(this.add(keyOrNode, val));
         }
         return inserted;
     };
@@ -286,11 +286,11 @@ var AbstractBinaryTree = (function () {
         this.clear();
         return idsOrNodes.length === this.addMany(idsOrNodes, data).length;
     };
-    AbstractBinaryTree.prototype.remove = function (nodeOrId) {
+    AbstractBinaryTree.prototype.remove = function (nodeOrKey) {
         var bstDeletedResult = [];
         if (!this.root)
             return bstDeletedResult;
-        var curr = typeof nodeOrId === 'number' ? this.get(nodeOrId) : nodeOrId;
+        var curr = typeof nodeOrKey === 'number' ? this.get(nodeOrKey) : nodeOrKey;
         if (!curr)
             return bstDeletedResult;
         var parent = (curr === null || curr === void 0 ? void 0 : curr.parent) ? curr.parent : null;
@@ -331,7 +331,7 @@ var AbstractBinaryTree = (function () {
     };
     AbstractBinaryTree.prototype.getDepth = function (beginRoot) {
         if (typeof beginRoot === 'number')
-            beginRoot = this.get(beginRoot, 'id');
+            beginRoot = this.get(beginRoot, 'key');
         var depth = 0;
         while (beginRoot === null || beginRoot === void 0 ? void 0 : beginRoot.parent) {
             depth++;
@@ -342,7 +342,7 @@ var AbstractBinaryTree = (function () {
     AbstractBinaryTree.prototype.getHeight = function (beginRoot) {
         beginRoot = beginRoot !== null && beginRoot !== void 0 ? beginRoot : this.root;
         if (typeof beginRoot === 'number')
-            beginRoot = this.get(beginRoot, 'id');
+            beginRoot = this.get(beginRoot, 'key');
         if (!beginRoot)
             return -1;
         if (this._loopType === types_1.LoopType.RECURSIVE) {
@@ -426,7 +426,7 @@ var AbstractBinaryTree = (function () {
         var _this = this;
         if (!this.root)
             return [];
-        propertyName = propertyName !== null && propertyName !== void 0 ? propertyName : 'id';
+        propertyName = propertyName !== null && propertyName !== void 0 ? propertyName : 'key';
         var result = [];
         if (this.loopType === types_1.LoopType.RECURSIVE) {
             var _traverse_1 = function (cur) {
@@ -454,12 +454,12 @@ var AbstractBinaryTree = (function () {
         return result;
     };
     AbstractBinaryTree.prototype.has = function (nodeProperty, propertyName) {
-        propertyName = propertyName !== null && propertyName !== void 0 ? propertyName : 'id';
+        propertyName = propertyName !== null && propertyName !== void 0 ? propertyName : 'key';
         return this.getNodes(nodeProperty, propertyName).length > 0;
     };
     AbstractBinaryTree.prototype.get = function (nodeProperty, propertyName) {
         var _a;
-        propertyName = propertyName !== null && propertyName !== void 0 ? propertyName : 'id';
+        propertyName = propertyName !== null && propertyName !== void 0 ? propertyName : 'key';
         return (_a = this.getNodes(nodeProperty, propertyName, true)[0]) !== null && _a !== void 0 ? _a : null;
     };
     AbstractBinaryTree.prototype.getPathToRoot = function (node, isReverse) {
@@ -474,7 +474,7 @@ var AbstractBinaryTree = (function () {
     };
     AbstractBinaryTree.prototype.getLeftMost = function (beginRoot) {
         if (typeof beginRoot === 'number')
-            beginRoot = this.get(beginRoot, 'id');
+            beginRoot = this.get(beginRoot, 'key');
         beginRoot = beginRoot !== null && beginRoot !== void 0 ? beginRoot : this.root;
         if (!beginRoot)
             return beginRoot;
@@ -523,9 +523,9 @@ var AbstractBinaryTree = (function () {
             var dfs_1 = function (cur, min, max) {
                 if (!cur)
                     return true;
-                if (cur.id <= min || cur.id >= max)
+                if (cur.key <= min || cur.key >= max)
                     return false;
-                return dfs_1(cur.left, min, cur.id) && dfs_1(cur.right, cur.id, max);
+                return dfs_1(cur.left, min, cur.key) && dfs_1(cur.right, cur.key, max);
             };
             return dfs_1(node, Number.MIN_SAFE_INTEGER, Number.MAX_SAFE_INTEGER);
         }
@@ -538,9 +538,9 @@ var AbstractBinaryTree = (function () {
                     curr = curr.left;
                 }
                 curr = stack.pop();
-                if (!curr || prev >= curr.id)
+                if (!curr || prev >= curr.key)
                     return false;
-                prev = curr.id;
+                prev = curr.key;
                 curr = curr.right;
             }
             return true;
@@ -574,23 +574,23 @@ var AbstractBinaryTree = (function () {
         }
     };
     AbstractBinaryTree.prototype.subTreeSum = function (subTreeRoot, propertyName) {
-        propertyName = propertyName !== null && propertyName !== void 0 ? propertyName : 'id';
+        propertyName = propertyName !== null && propertyName !== void 0 ? propertyName : 'key';
         if (typeof subTreeRoot === 'number')
-            subTreeRoot = this.get(subTreeRoot, 'id');
+            subTreeRoot = this.get(subTreeRoot, 'key');
         if (!subTreeRoot)
             return 0;
         var sum = 0;
         var _sumByProperty = function (cur) {
             var needSum;
             switch (propertyName) {
-                case 'id':
-                    needSum = cur.id;
+                case 'key':
+                    needSum = cur.key;
                     break;
                 case 'val':
                     needSum = typeof cur.val === 'number' ? cur.val : 0;
                     break;
                 default:
-                    needSum = cur.id;
+                    needSum = cur.key;
                     break;
             }
             return needSum;
@@ -615,18 +615,18 @@ var AbstractBinaryTree = (function () {
         return sum;
     };
     AbstractBinaryTree.prototype.subTreeAdd = function (subTreeRoot, delta, propertyName) {
-        propertyName = propertyName !== null && propertyName !== void 0 ? propertyName : 'id';
+        propertyName = propertyName !== null && propertyName !== void 0 ? propertyName : 'key';
         if (typeof subTreeRoot === 'number')
-            subTreeRoot = this.get(subTreeRoot, 'id');
+            subTreeRoot = this.get(subTreeRoot, 'key');
         if (!subTreeRoot)
             return false;
         var _addByProperty = function (cur) {
             switch (propertyName) {
-                case 'id':
-                    cur.id += delta;
+                case 'key':
+                    cur.key += delta;
                     break;
                 default:
-                    cur.id += delta;
+                    cur.key += delta;
                     break;
             }
         };
@@ -650,7 +650,7 @@ var AbstractBinaryTree = (function () {
         return true;
     };
     AbstractBinaryTree.prototype.BFS = function (nodeOrPropertyName) {
-        nodeOrPropertyName = nodeOrPropertyName !== null && nodeOrPropertyName !== void 0 ? nodeOrPropertyName : 'id';
+        nodeOrPropertyName = nodeOrPropertyName !== null && nodeOrPropertyName !== void 0 ? nodeOrPropertyName : 'key';
         this._clearResults();
         var queue = [this.root];
         while (queue.length !== 0) {
@@ -668,7 +668,7 @@ var AbstractBinaryTree = (function () {
     AbstractBinaryTree.prototype.DFS = function (pattern, nodeOrPropertyName) {
         var _this = this;
         pattern = pattern !== null && pattern !== void 0 ? pattern : 'in';
-        nodeOrPropertyName = nodeOrPropertyName !== null && nodeOrPropertyName !== void 0 ? nodeOrPropertyName : 'id';
+        nodeOrPropertyName = nodeOrPropertyName !== null && nodeOrPropertyName !== void 0 ? nodeOrPropertyName : 'key';
         this._clearResults();
         var _traverse = function (node) {
             switch (pattern) {
@@ -700,7 +700,7 @@ var AbstractBinaryTree = (function () {
     };
     AbstractBinaryTree.prototype.DFSIterative = function (pattern, nodeOrPropertyName) {
         pattern = pattern || 'in';
-        nodeOrPropertyName = nodeOrPropertyName || 'id';
+        nodeOrPropertyName = nodeOrPropertyName || 'key';
         this._clearResults();
         if (!this.root)
             return this._getResultByPropertyName(nodeOrPropertyName);
@@ -740,7 +740,7 @@ var AbstractBinaryTree = (function () {
         return this._getResultByPropertyName(nodeOrPropertyName);
     };
     AbstractBinaryTree.prototype.levelIterative = function (node, nodeOrPropertyName) {
-        nodeOrPropertyName = nodeOrPropertyName || 'id';
+        nodeOrPropertyName = nodeOrPropertyName || 'key';
         node = node || this.root;
         if (!node)
             return [];
@@ -761,15 +761,15 @@ var AbstractBinaryTree = (function () {
         return this._getResultByPropertyName(nodeOrPropertyName);
     };
     AbstractBinaryTree.prototype.listLevels = function (node, nodeOrPropertyName) {
-        nodeOrPropertyName = nodeOrPropertyName || 'id';
+        nodeOrPropertyName = nodeOrPropertyName || 'key';
         node = node || this.root;
         if (!node)
             return [];
         var levelsNodes = [];
         var collectByProperty = function (node, level) {
             switch (nodeOrPropertyName) {
-                case 'id':
-                    levelsNodes[level].push(node.id);
+                case 'key':
+                    levelsNodes[level].push(node.key);
                     break;
                 case 'val':
                     levelsNodes[level].push(node.val);
@@ -778,7 +778,7 @@ var AbstractBinaryTree = (function () {
                     levelsNodes[level].push(node);
                     break;
                 default:
-                    levelsNodes[level].push(node.id);
+                    levelsNodes[level].push(node.key);
                     break;
             }
         };
@@ -829,7 +829,7 @@ var AbstractBinaryTree = (function () {
         if (this.root === null)
             return [];
         pattern = pattern || 'in';
-        nodeOrPropertyName = nodeOrPropertyName || 'id';
+        nodeOrPropertyName = nodeOrPropertyName || 'key';
         this._clearResults();
         var cur = this.root;
         var _reverseEdge = function (node) {
@@ -938,8 +938,8 @@ var AbstractBinaryTree = (function () {
     AbstractBinaryTree.prototype._setLoopType = function (value) {
         this._loopType = value;
     };
-    AbstractBinaryTree.prototype._setVisitedId = function (value) {
-        this._visitedId = value;
+    AbstractBinaryTree.prototype._setVisitedKey = function (value) {
+        this._visitedKey = value;
     };
     AbstractBinaryTree.prototype._setVisitedVal = function (value) {
         this._visitedVal = value;
@@ -957,14 +957,14 @@ var AbstractBinaryTree = (function () {
         this._size = v;
     };
     AbstractBinaryTree.prototype._clearResults = function () {
-        this._visitedId = [];
+        this._visitedKey = [];
         this._visitedVal = [];
         this._visitedNode = [];
     };
     AbstractBinaryTree.prototype._pushByPropertyNameStopOrNot = function (cur, result, nodeProperty, propertyName, onlyOne) {
         switch (propertyName) {
-            case 'id':
-                if (cur.id === nodeProperty) {
+            case 'key':
+                if (cur.key === nodeProperty) {
                     result.push(cur);
                     return !!onlyOne;
                 }
@@ -976,7 +976,7 @@ var AbstractBinaryTree = (function () {
                 }
                 break;
             default:
-                if (cur.id === nodeProperty) {
+                if (cur.key === nodeProperty) {
                     result.push(cur);
                     return !!onlyOne;
                 }
@@ -984,10 +984,10 @@ var AbstractBinaryTree = (function () {
         }
     };
     AbstractBinaryTree.prototype._accumulatedByPropertyName = function (node, nodeOrPropertyName) {
-        nodeOrPropertyName = nodeOrPropertyName !== null && nodeOrPropertyName !== void 0 ? nodeOrPropertyName : 'id';
+        nodeOrPropertyName = nodeOrPropertyName !== null && nodeOrPropertyName !== void 0 ? nodeOrPropertyName : 'key';
         switch (nodeOrPropertyName) {
-            case 'id':
-                this._visitedId.push(node.id);
+            case 'key':
+                this._visitedKey.push(node.key);
                 break;
             case 'val':
                 this._visitedVal.push(node.val);
@@ -996,21 +996,21 @@ var AbstractBinaryTree = (function () {
                 this._visitedNode.push(node);
                 break;
             default:
-                this._visitedId.push(node.id);
+                this._visitedKey.push(node.key);
                 break;
         }
     };
     AbstractBinaryTree.prototype._getResultByPropertyName = function (nodeOrPropertyName) {
-        nodeOrPropertyName = nodeOrPropertyName !== null && nodeOrPropertyName !== void 0 ? nodeOrPropertyName : 'id';
+        nodeOrPropertyName = nodeOrPropertyName !== null && nodeOrPropertyName !== void 0 ? nodeOrPropertyName : 'key';
         switch (nodeOrPropertyName) {
-            case 'id':
-                return this._visitedId;
+            case 'key':
+                return this._visitedKey;
             case 'val':
                 return this._visitedVal;
             case 'node':
                 return this._visitedNode;
             default:
-                return this._visitedId;
+                return this._visitedKey;
         }
     };
     return AbstractBinaryTree;