. . , , , : samp ob[4]={1,2,3,4};
:
samp ob[4]={samp(1,2),samp(3,4),samp(5,6),samp(7,8)};
new, . delete, .
. . . , . , - - , . .
. Tree ( ). . , , , , (, ).
#include"vip\menu.cpp" //
#include <conio.h>
#include <string.h>
#include <iostream.h>
char bufRus[256];
char*Rus(const char*text){
CharToOem(text,bufRus);
return bufRus;}
struct node
{
int n; //
int count;
node*left,*right;
};
class Tree
{
public:
node*root;
Tree(){root=0;}
Tree(int t); // t
void CopyTree(node*&rootnew,node*rootold);
/* rootold rootnew. .*/
Tree(const Tree&ob); //
// , ( )
void DelTree(node *wer);
~Tree(){DelTree(root);}
void Push(node*&wer,int data);//
void Look(node*wer); //-
node*Find(node*wer,int key); //
void PrintLeaves(node *wer); //
};
//********************** Tree::Tree(int t) *******************
Tree::Tree(int t)
{
root=0;
for(int i=0;i<t;i++)
Push(root,random(10)-5);
}
void Tree::CopyTree(node*&rootnew,node*rootold)
{
if(rootold->left!=0)
{Push(rootnew,(rootold->left)->n);CopyTree(rootnew,rootold->left);}
if(rootold->right!=0)
{Push(rootnew,(rootold->right)->n);CopyTree(rootnew,rootold->right);}
|
|
|
}
Tree::Tree(const Tree&ob)
{
if(ob.root==0)root=0;
else {
root=new node;
root->n=ob.root->n;
root->count=1;
root->left=0;
root->right=0;
CopyTree(root,ob.root);
}
}
void Tree::DelTree(node *wer)
{
if(wer->left!=0)DelTree(wer->left);
if(wer->right!=0)DelTree(wer->right);
delete wer;
}
void Tree::Push(node*&wer,int data)
{
if(wer==0)
{
wer=new node;
wer->n=data;
wer->left=0;wer->right=0;
wer->count=1;
}
else if(data<wer->n)Push(wer->left,data);
else if(data>wer->n)Push(wer->right,data);
else wer->count++;
}
void Tree::Look(node*wer)
{
if(wer!=0)
{
Look(wer->left);
cout<<Rus(": ")<<wer->n<<" - "<<wer->count;
cout<<Rus(" ")<<endl;
Look(wer->right);
}
}
node* Tree::Find(node*wer,int key)
{
if(wer==0) return 0;
else if(key<wer->n) return Find(wer->left,key);
else if(key>wer->n) return Find(wer->right,key);
else return wer;
}
void Tree::PrintLeaves(node *wer)
{
if(wer==0)return;
else if((wer->left==0)&&(wer->right==0)) {
cout<<Rus(: )<<wer->n<<-<<wer->count;
cout<<Rus()<<endl;
}
else
{
PrintLeaves(wer->left);
PrintLeaves(wer->right);
}
}
//-------------------------------- MAIN ----------------------------------------
int main(int argc, char* argv[])
{
Tree tr;
node *u;
int k=0,max,kol;
char menu[][100]={ {" PushElement "}, {" ShowTree "}, {" FindElement "},
{" PrintLeaves "}, {" EXIT "}, };
kol=5;// .
// .
//------------------ ----------------
max=viravnivaniestrok(menu,kol);
//------------------------ ---------------------------------------
textmode(C80);
while(1){
switch(mmm(kol,menu,max,k))
{ case 0: {
int data;
cout<<Rus(" :");
cin>>data;
tr.Push(tr.root,data);
k=0;break;
}
case 1: {
if(tr.root==0)cout<<Rus(" ");
else
{
cout<<Rus(" :")<<endl;
tr.Look(tr.root);
}
while(!kbhit());
k=1;break;
}
case 2: {
if(tr.root==0)cout<<Rus(" ");
else
{
int key;
cout<<Rus(" :");
cin>>key;
if((u=tr.Find(tr.root,key))!=0){
cout<<Rus(": ");
cout<<key;
cout<<Rus(" ");
cout<<u->count<<Rus(" ");
}
else cout<<Rus(" !");
}
while(!kbhit());
k=2;break;
}
case 3: {
if(tr.root==0)cout<<Rus(" ");
else{
cout<<Rus(":")<<endl;
tr.PrintLeaves(tr.root);
}
while(!kbhit());
k=3;break;
}
case 4:{
exit(0);
}
} }
return 0;
}
, . , : a) ; ) . :
|
|
|
) ;
) .
1. . . : a) ; ) ( ).
2. . . . .
3. . . , . , .
4. . . (, ) .
5. . . , , , . , . . , .
6. . . , , : a) ; ) ; ) .
7. . . , ( ), .
8. . . , . ( ).
9. . : List1 List2. , List1 List2 List1 .
10. . . List1. List2, List1.
11. . . List1, 
. List2, 
.
12. , . , . ( , ).
13. , . . ( , ). , .
14. , . . , , .
15. . : , , , .
: , , , , .
16. , ( , ): , , , .
|
|
|
: , , , , .
17. , : , , , .
: , . . , , , .
18. , , .
19. , - .
20. , . : , , .
, , , , , .
1. (, ) ()?
2. :
1) ;
2) ;
3) ;
4) ;
5) ?
3. :
~Tree(){del_tree(root);}
void del_tree(Node *root){
if(!root){
delete root;
del_tree(root->left);
del_tree(root->right);}}?
4. :
~List(){
Node *V;
if(begin){
V=begin;
while(V){
delete V;
V=V->next;}}}?
begin .
