@structured/weight-balanced-tree
An immutable weight balanced tree implementation. A weight-balanced tree is a self-balancing binary search tree.
Weight balancing is a way of implementing a self-balancing binary search tree. Binary search trrees have many applications; for example, sorted implementations of dynamic lists and sets.
Installation
yarn add @structured/weight-balanced-tree