<commit_before># data_structure2

Binary search tree
Bst able to insert a new node. If the new value is greater it will be inserted
to the right if less it will be inserted in the left duplicates will be
ignored. Contains method will return if a value is in the Binary search tree.
Size method will return the number of values stored in the tree. Depth will
return number of levels the tree has. Balance will return the number how
many levels the right has more than the left.

Binary Search Tree: Transverse Strategies
Updated Bst to include four methods of transversal. One breadth first and
three depth first. The depth first methods are as follows: pre-order
post-order and in-order.
http://en.wikipedia.org/wiki/Tree_traversal#In-order_.28symmetric.29
<commit_msg>Updated README for hash table<commit_after># data_structure2

Binary search tree
Bst able to insert a new node. If the new value is greater it will be inserted
to the right if less it will be inserted in the left duplicates will be
ignored. Contains method will return if a value is in the Binary search tree.
Size method will return the number of values stored in the tree. Depth will
return number of levels the tree has. Balance will return the number how
many levels the right has more than the left.

Binary Search Tree: Transverse Strategies
Updated Bst to include four methods of transversal. One breadth first and
three depth first. The depth first methods are as follows: pre-order
post-order and in-order.
http://en.wikipedia.org/wiki/Tree_traversal#In-order_.28symmetric.29

Hash Table
Created a simple hash table which stores key and value pairs as a
list of lists. The hashing method is a simple summation of values
for input into a list. The hashing method is a sub module of the class
and can be easily replaced with a more prefect method at a later time.


{'fraction_non_alphanumeric': 0.033134166214014125, 'fraction_numerical': 0.005431830526887561, 'mean_word_length': 4.2628571428571425, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, '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': '2664246', 'n_tokens_mistral': 481, 'n_tokens_neox': 457, 'n_words': 298}