#include #include #include #include "binary_search_tree.h" void free_tree(node_t *tree) { if (tree == NULL) { return 0; } free_tree(tree->left); free_tree(tree->right); free(tree); } node_t *build_tree(int *tree_data, size_t tree_data_len){ node_t *koren = (node_t *)malloc(sizeof(node_t)); if(tree_data == NULL || tree_data_len == 0){ return 0; } if(tree_data != NULL && tree_data_len != 0){ koren->data = tree_data[0]; koren->left = (node_t *)malloc(sizeof(node_t)); koren->left->data = tree_data[0]; } return koren; }