Insert on a binary search tree

node * insert(node * root, int value) {
    if (!root){
        node *newLeaf;
        newLeaf->data = value;
        newLeaf->left = NULL;
        newLeaf->right = NULL;
        root = newLeaf;
    }
    else {
        int key = root->data;
        if (value <= key) {
            return insert(root->left, value);
        } else {
            return insert(root->right, value);
        }
    }

   return root;
}