delete node for a binary tree

[AmazingRando]

I am having serious problems implementing a delete_node function for a binary tree
it works fine unless the target to be deleted has 2 children. Then the children are lost
Any help would be much appreciated

int Delete_Node(SSummary *data, Tree_Header *psTree, Tree_node *treecurrent, Tree_node *treeparent, Tree_node *temp)
{
	char zip_answer[8];
	int children_count = 0, confirmation;
	int comparison_count = 0, y = 0;
	printf("What zipcode would you like to delete from the tree: ");
	scanf("%s",&zip_answer);
	treecurrent = psTree->pRoot; 
	
	while(treecurrent != NULL)
	{
		
		comparison_count++;
		if(strcmp(treecurrent->zipcode, zip_answer) == 0)
		{
			//match
			printf("\nThe record was found with %d comparison(s)",comparison_count);
			printf("\n---------------Record---------------");
			printf("\nZipcode: %s",treecurrent->zipcode);
			printf("\nCity, State: %s, %s",treecurrent->city, treecurrent->state);
			printf("\nPopulation: %d",treecurrent->population);
			printf("\nLatitude, Longitude: %-.2f, %-.2f\n\n", treecurrent->latitude, treecurrent->longitude);
			printf("\n\nAre you sure you want to delete this node?");
			printf("\n1. Yes");
			printf("\n2. No\n");
			scanf("%d",&confirmation);
			if(confirmation == 2)
			{
				break;
			}
			//counting the number of children
			if (treecurrent->left == NULL && treecurrent->right == NULL)
			{
				children_count = 0;
			}
			else
			{
				if(treecurrent->left != NULL)
				{
					children_count = 1;
				}
				if(treecurrent->right != NULL)
				{
					children_count = 1;
				}
				else
				{
					children_count = 2;
				}
			}
			
			//proceeding on basis of number of children
			if(children_count == 0)
			{
				//Leaf node//
				treeparent = treecurrent->parent;
				treeparent->left = NULL;
				free(treecurrent);
			
			}
			if(children_count == 1)
			{
				//if statement to find if right or left
				if(treecurrent->right == NULL)
				{
					//Single left child
					treeparent = treecurrent->parent;
					if(treeparent->right == treecurrent)
					{
						//treecurrent is referenced by the right parent pointer
						treeparent->right = treecurrent->left;
						treecurrent->left->parent = treeparent;
						free(treecurrent);
						
					}
					if(treeparent->left == treecurrent)
					{
						//treecurrent is referenced by the left parent pointer
						treeparent->left = treecurrent->left;
						treecurrent->left->parent = treeparent;
						free(treecurrent);
						
					}
				}
				else
				{
					//Single Right child
					treeparent = treecurrent->parent;
					if(treeparent->right == treecurrent)
					{
						//treecurrent is referenced by the right parent pointer
						treeparent->right = treecurrent->right;
						treecurrent->right->parent = treeparent;
						free(treecurrent);
					
					}
					if(treeparent->left == treecurrent)
					{
						//treecurrent is referenced by the left parent pointer
						treeparent->left = treecurrent->right;
						treecurrent->right->parent = treeparent;
						free(treecurrent);
						
					}
				}
			}
			if(children_count == 2)//got serious problems here//
			{
				printf("we are here");//print test
				//Two Children				
				treeparent = treecurrent->parent;
				if (treeparent->left == treecurrent)
				{
					treeparent->left = treecurrent->right;
					temp = treecurrent->right;
					temp->left = treecurrent->left;
				}
				else
				{
					temp = treecurrent;
					temp = temp->left;	 
					treeparent->right = treecurrent->left;
					treecurrent->left->right = treecurrent->right;
					
				}
				
				free(treecurrent);
				
				
			}
			
			printf("\nThe record was found and deleted\n");
			break;
			}

			else
			{
				if(strcmp(treecurrent->zipcode, zip_answer) < 0)
				{
					//go right
					treecurrent = treecurrent->right;
				}
				else
				{
					//go left
					treecurrent = treecurrent->left;
				}
				
				
			}
			if(treecurrent == NULL)
			{
				printf("\nNo record was found\n");
			}
			}//end while
			
			return 0;
}

[Codeplug]

Your "children_count" is wrong when both "->left" and "->right" do not equal NULL.
Haven't looked at the rest of it.

gg

[AmazingRando]

ok changed that part to this

//counting the number of children
			if (treecurrent->left == NULL && treecurrent->right == NULL)
			{
				children_count = 0;
			}
			else
			{
				if(treecurrent->left != NULL && treecurrent->right != NULL)
				{
					children_count = 2;
				}
				else
				{
					children_count = 1;
				}
			
			}

[AmazingRando]

still doesn't work though

[Codeplug]

Binary Tree Deletion

gg