<commit_before>binarytrees
===========

Simple implementation of binary trees<commit_msg>Added instructions for building the code<commit_after>BinaryTrees
===========

This project contains a simple implementation of binary trees.

It includes an interface `ITraversal<T>` to traverse using the following strategies

- Pre Order
- In Order
- Post Order

It includes a generic `Node<T>`

###Build instructions
1.  Clone the repo
2.  Open it with Visual Studio
3.  Build it
4.  Run it 
{'fraction_non_alphanumeric': 0.09730848861283643, 'fraction_numerical': 0.008281573498964804, 'mean_word_length': 4.761904761904762, 'pattern_counts': {'":': 0, '<': 5, '<?xml version=': 0, '>': 5, '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': '6657799', 'n_tokens_mistral': 135, 'n_tokens_neox': 127, 'n_words': 60}