<commit_before>#include <stdio.h>
#include <stdlib.h>
#include "BST.h"

int main() {
    struct bst *tree = NULL;

    push(&tree, 6);
    push(&tree, 4);
    push(&tree, 9);
    push(&tree, 5);

    printf("%d\n", tree->number);
    printf("%d\n", tree->left->number);
    printf("%d\n", tree->right->number);
    printf("%d\n", tree->left->right->number);

    return 0;
}
<commit_msg>Simple example of BST usage<commit_after>#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include "BST.h"

int main() {
    struct bst *tree = NULL;
    struct bst *found_node = malloc(sizeof(*found_node));

    int nbr[10] = {54, 65 ,87 ,23, 53, 32, 13, 53, 98, 34};

    for (int i = 0; i < 10; ++i) {
        push(&tree, nbr[i]);
    }

    found_node = search(tree, 53);
    printf("%d\n", found_node->number);
    printf("%d\n", found_node->left->number);
    printf("%d\n", found_node->right->number);
    return 0;
}

{'fraction_non_alphanumeric': 0.2141304347826087, 'fraction_numerical': 0.035869565217391305, 'mean_word_length': 3.167420814479638, 'pattern_counts': {'":': 0, '<': 9, '<?xml version=': 0, '>': 21, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 1, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '6660382', 'n_tokens_mistral': 391, 'n_tokens_neox': 350, 'n_words': 84}