fork(1) download

copy

#include <stdio.h>
#include<malloc.h>
 
struct node
{
 	int data;
 	struct node *left,*right;
};
 
struct node *root=NULL;
 
int findmin(struct node *root);
 
struct node *insert(struct node *root,int val)
{
	struct node *par=NULL,*cur,*nn;
	nn=(struct node*)malloc(sizeof(struct node*));
	nn->data=val;
	nn->left=nn->right=NULL;
 
	if(root==NULL)
	{
		root=nn;
		return root;
	}
 
	cur=root;
 
	while(cur!=NULL)
	{
		par=cur;
		if(val<cur->data)
			cur=cur->left;
		else
			cur=cur->right;
	}
 
	if(val<par->data)
			par->left=nn;
		else
			par->right=nn;
 
	return root;
}
 
struct node *Delete(struct node *root,int data)
{
	if(root == NULL) return root; 
	else if(data < root->data) root->left = Delete(root->left,data);
	else if (data > root->data) root->right = Delete(root->right,data);
	// Wohoo... I found you, Get ready to be deleted	
	else {
		// Case 1:  No child
		if(root->left == NULL && root->right == NULL) { 
			free(root);
			root = NULL;
		}
		//Case 2: One child 
		else if(root->left == NULL) {
			struct Node *temp = root;
			root = root->right;
				free(temp);
		}
		else if(root->right == NULL) {
			struct Node *temp = root;
			root = root->left;
			free(temp);
		}
		// case 3: 2 children
		else { 
			struct Node *temp = FindMin(root->right);
			root->data = temp->data;
			root->right = Delete(root->right,temp->data);
		}
	}
	return root;
 
}
 
void inorder(struct node *root)
{
	if(root!=NULL)
	{
		inorder(root->left);
		printf("\t%d",root->data);
		inorder(root->right);
	}
}
 
int findmin(struct node *root)
{
	if((root==NULL)||(root->left==NULL))
		return root;
	else
		return findmin(root->left);
 
}
 
int main()
{
	int ln,tn,s,l;
 
	root=insert(root,23);
	root=insert(root,20);
	root=insert(root,25);
	root=insert(root,21);
	root=insert(root,19);
	root=insert(root,24);
	root=insert(root,27);
	root=insert(root,28);
	root=insert(root,26);
	root=insert(root,29);
	root=insert(root,22);
 
	root=delete(root,27);
 
	printf("\n");
	inorder(root);
 
	printf("\n");
return 0;
}

prog.c: In function 'Delete':
prog.c:60:24: warning: initialization from incompatible pointer type [-Wincompatible-pointer-types]
    struct Node *temp = root;
                        ^
prog.c:65:24: warning: initialization from incompatible pointer type [-Wincompatible-pointer-types]
    struct Node *temp = root;
                        ^
prog.c:71:24: warning: implicit declaration of function 'FindMin' [-Wimplicit-function-declaration]
    struct Node *temp = FindMin(root->right);
                        ^
prog.c:71:24: warning: initialization makes pointer from integer without a cast [-Wint-conversion]
prog.c:72:21: error: dereferencing pointer to incomplete type 'struct Node'
    root->data = temp->data;
                     ^
prog.c: In function 'findmin':
prog.c:93:10: warning: return makes integer from pointer without a cast [-Wint-conversion]
   return root;
          ^
prog.c: In function 'main':
prog.c:115:7: warning: implicit declaration of function 'delete' [-Wimplicit-function-declaration]
  root=delete(root,27);
       ^
prog.c:115:6: warning: assignment makes pointer from integer without a cast [-Wint-conversion]
  root=delete(root,27);
      ^
prog.c:101:14: warning: unused variable 'l' [-Wunused-variable]
  int ln,tn,s,l;
              ^
prog.c:101:12: warning: unused variable 's' [-Wunused-variable]
  int ln,tn,s,l;
            ^
prog.c:101:9: warning: unused variable 'tn' [-Wunused-variable]
  int ln,tn,s,l;
         ^
prog.c:101:6: warning: unused variable 'ln' [-Wunused-variable]
  int ln,tn,s,l;
      ^

Standard output is empty