The **@sailshq/binary-search-tree** package provides a lightweight implementation of binary search trees for Node.js, offering both a simple BST and a self‑balancing AVL tree. It supplies `insert`, `search`, and `delete` operations with optional uniqueness, custom key comparison, and value‑equality functions, making it ideal for developers who need fast in‑memory indexing—especially those using the NeDB database.