All notable changes to this project will be documented in this file.
The format is based on Keep a Changelog, and this project adheres to Semantic Versioning.
- insertIterative
- hasIterative
- findIterative
- maxIterative
- minIterative
- lowerBoundIterative
- upperBoundIterative
- removeIterative
- traverseInOrderIterative
- traversePreOrderIterative
- traversePostOrderIterative
- README
- AvlTree balance function.
- AvlTree ts types.
removeNodeto remove a node by its reference.upperBoundKey,floorKey,lowerBoundKey,ceilKeyto support finding nodes by the object comparison key.
- findKey & hasKey to find object nodes directly by the key prop value.
- ability to abort tree traversal using a callback.
.removetypos + was not balancing nodes properly on one case.
- types field in package.json
- tree now accepts a compare function.
- readme.
- ts types.
.floor&.ceilas delegates to.lowerBound&upperBound.
.lowerBound&upperBoundnow finds the precise bound when multiple ones exist.- make param (value) optional on
.insert.
- index.d.ts
- export.
- typescript.
- typo in export name.
.lowerBound(k)to find the node with biggest key less or equal a value k..upperBound(k)to find the node with smallest key bigger than a value k.
- exported AvlTreeNode path.
- return inserted node from
insert. - BinarySearchTreeNode & AvlTreeNode methods.
- README
- jsdoc
- update the removed node value with min right one in avl tree.
- update the removed node value with min right one.
- README
- README
- jsdoc
- README
- README
- jsdoc
- use the same balancing algorithm for insert and remove.
- AvlTreeNode & AvlTree implementation.
- return the updated node in
.insert
- New release