Binary Search Tree remove()

[xarrtarrant]

Im working on a BST remove function. I think I'm on the right track but I'm not sure. From what I understand there are 3 possible cases. A Node with no children, one child, or 2 children(this being the most complex). Can anyone tell me if im on the right track? Thanks for the help.

  void BST::remove(int x)
{
	TreeNode *n;
	TreeNode *v;
	n= root;
	while(n != NULL && n->key != x){
		if(n->key > x){
			v = n;
			n = n->left;
		}
		if(n->key < x){
			v = n;
			n = n->right;
		}
	}
	if(n->key == x){
		if(n->right == NULL && n->left == NULL){
			v->right = NULL;
			v->left = NULL;
		}
		if(n->right != NULL && n->left == NULL){
			v->right = n->right;
		}
		if(n->right == NULL && n->left != NULL){
			v->left = n->left;
		}
		if(n->right != NULL && n->left != NULL){
                        TreeNode *temp = n->right;
                        TreeNode *othertemp;
			while(temp->left != NULL){
				othertemp = temp;
                                temp = temp->left;
			}
			n->key = temp->key;
                        othertemp->left = NULL;
		}
	}
}