bintree.c
#include <stdlib.h>
#include "bintree.h"
p_node searchBST(t_tree t, int val){
p_node current = t.root;
while (current != NULL) {
if (current->value == val) {
return current;
}
else if (current->value > val) {
current = current->left;
}
else {
current = current->right;
}
}
return NULL;
}
