Tree Recursive Insert
–
void insert(node * & root, data & d){
–
if (!root) {
–
root = new node;
–
root->d = d;
–
root->left = NULL;
–
root->right = NULL;
–
}
–
else if (root->d > d)
–
insert(root->left, d);
–
else
insert(root->right, d);
–
}
–
