<commit_before># Binary Search Tree

## Description
Javascript implementation of a binary search tree data structure.

Work in progress; check back later.<commit_msg>Update README -- start documentation<commit_after># Binary Search Tree

## Description
Javascript implementation of a
[binary search tree](https://en.wikipedia.org/wiki/Binary_search_tree)
data structure.

Work in progress; check back later...

#### Environment:

Although this implementation is designed to be used with
[Node.js](http://www.nodejs.org), it could be used in other contexts with minor
modifications.  This implementation does not have any external dependencies
that would preclude it from being used in the browser--just include it with a
`<script>` tag and it should be good to go.  _Disclaimer: I have not tested
this implementation in any other context/environment; only tested with node.js_

----

## Basic Usage

Work in progress; check back later...

## API
**Available methods for a binary search tree instance:**

Work in progress; check back later...
{'fraction_non_alphanumeric': 0.0787704130643612, 'fraction_numerical': 0.0, 'mean_word_length': 4.572192513368984, 'pattern_counts': {'":': 0, '<': 4, '<?xml version=': 0, '>': 4, 'https://': 1, 'lorem ipsum': 0, 'www.': 1, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '2511467', 'n_tokens_mistral': 263, 'n_tokens_neox': 252, 'n_words': 132}