Сайт студентов ИАТЭ специальности ИС

void search (node *&t, int x)
{if (t==0){t=new node;
t->key=x;
t->cout=1;
t->left=0;
t->right=0;
}
else
if(x>t->key)
search (t->right, x)
else
if(x<t->key)search(t->left, x)
else t->cout++;
}
node *buildPoisk (int n)
{int i,x; node *t=0;
for (i=0; i<n; i++)
{cout<<"\n Vvedite ocherednoe n \n";
cin>>x;
search (t,x);
}
return t;
}

.............
.............
while (first!=0 && first->info<0)
{p=first;
first=p->next;
delete p;
}
output (first, "\n Spisok posle Isklychenia \n");
while (last t!=0 && last ->info<0)
{p=last;
last=p->prev;
delete p;
}

int n=10
for (int i=0; i<n; i++)
{p=last;
last=p->prev;
delete p};

void compare(node *first, node *first2)
{
int f=1;
node *q, *t, *p=first;
while (p!=0&&f==1)
{
q=first2;
t=p; p=p->next;
cout <<"*\n"
while (q&&p->info==q->info)
{
t=t->next;
q=q->next;
}
if (q==0) f=0;
}
if (f) cout<<"\n Spisok L2 ne vhodit v L1 \n";
else cout<<"\n Spisok L2 vhodit v L1 \n";
}