fork download

copy

#include <stdio.h>
#include <time.h>
#include <stdlib.h>
#include <string.h>
struct node{
	char q[20];
	int nomer;
	node *l, *r;
};
node *tree = NULL;
 
int Delete(node **t, char target[], int target1);
void push(char a[], int n, node **t);
void search(char a[], node *t);
void print (node *t, int u);
 
void push(char a[], int n, node **t){
	if((*t) == NULL){
		*t = new node;
		strcpy_s((*t) -> q, a);
		(*t) -> nomer = n; 
		(*t)->l = (*t)->r = NULL;
		return;
	}
	if(strcmp(a,(*t) -> q) > 0) 
		push(a, n, &((*t)->r));
	else if(strcmp(a,(*t) -> q) < 0)
		push(a, n, &((*t)->l));
}
void search(char a[], node *t){
	if(t == NULL)
		return;
	if(strcmp(a, t->q) == 0){
		strcpy_s(t->q, "Andrey");
		return;
	}
	search(a, t->l);
	search(a, t->r);
}
int Delete(node **t, char target[]){
	if ( (*t) == 0 ) 
		return 0;
	if (strcmp((*t)->q,target) == 0 )
	{
		if(((*t)->l!=0)&&((*t)->r!=0))
		{
			node *P=new node;
			P=(*t)->l;
			if(P->r==0)
			{
				strcpy_s((*t)->q, P -> q);
				(*t)->nomer = P->nomer;
				(*t)->l = P->l;
			}
			else
			{
				while (P->r->r!=0) 
					P = P->r; 
				strcpy_s((*t)->q, P->r->q);
				(*t)->nomer = P->nomer;
				P->r=0;
			}
			return 0;
		} 
		else 
			return 1;
	}
	if(Delete( &((*t)->l), target))
	{
		if ( (*t)->l->l == 0 )
			(*t)->l = (*t)->l->r;
		else
			(*t)->l = (*t)->l->l;
			return 0;
	}
	if(Delete(&((*t)->r), target))
	{
		if ( (*t)->r->l == 0 )
			(*t)->r = (*t)->r->r; 
		else
			(*t)->r = (*t)->r->l;
		return 0;
	}
	return 0;
}
 
void print (node *t,int u) 
{
	if (t==NULL){
		return;   
    }
 
    print(t->l,++u);
    for (int i=0;i<u;++i) 
		printf(" - ");
	printf("%s %d\n",t->q, t->nomer);
    u--;
 
    print(t->r,++u);
}
 
 
void main(){
	int n, n1;
	char name[20];
	printf("Enter nuber of elements ");
	scanf_s("%d", &n);
 
	for(int i = 0; i < n; i++){
		printf("\nEnter name: ");
		fflush(stdin);
		gets_s(name);
		printf("\nEnter nomber: ");
		scanf_s("%d", &n1);
		push(name, n1, &tree);
	}
	printf("your tree\n");
	print(tree, 0);
 
	char a[20];
	printf("Enter name for search ");
	fflush(stdin);
	gets_s(a);
	search(a, tree);
 
	printf("\n\nyour tree\n");
	print(tree, 0);
 
	char b[20];
	printf("\nenter name for delete: ");
	fflush(stdin);
	gets_s(b);
	Delete(&tree, b);
	printf("\n\nyour tree after deletion of element\n");
	print(tree, 0);
}

prog.cpp: In function ‘void push(char*, int, node**)’:
prog.cpp:20:24: error: ‘strcpy_s’ was not declared in this scope
   strcpy_s((*t) -> q, a);
                        ^
prog.cpp: In function ‘void search(char*, node*)’:
prog.cpp:34:26: error: ‘strcpy_s’ was not declared in this scope
   strcpy_s(t->q, "Andrey");
                          ^
prog.cpp: In function ‘int Delete(node**, char*)’:
prog.cpp:51:29: error: ‘strcpy_s’ was not declared in this scope
     strcpy_s((*t)->q, P -> q);
                             ^
prog.cpp:59:30: error: ‘strcpy_s’ was not declared in this scope
     strcpy_s((*t)->q, P->r->q);
                              ^
prog.cpp: At global scope:
prog.cpp:103:11: error: ‘::main’ must return ‘int’
 void main(){
           ^
prog.cpp: In function ‘int main()’:
prog.cpp:107:18: error: ‘scanf_s’ was not declared in this scope
  scanf_s("%d", &n);
                  ^
prog.cpp:112:14: error: ‘gets_s’ was not declared in this scope
   gets_s(name);
              ^
prog.cpp:123:10: error: ‘gets_s’ was not declared in this scope
  gets_s(a);
          ^

Standard output is empty