Files
aisd/Lab2/bst/bst.h
T

10 lines
160 B
C

struct Tree {
int info;
Tree *left;
Tree *right;
};
Tree *insert(Tree *root, int value);
Tree *search(Tree *root, int value);
void freeTree(Tree *root);