solidster
April 16th, 2012, 01:32 PM
Hi; guys here is my program typed in gedit i dnt know everything looks so perfect after i execute i get an error called "segmentation fault" PLZ HELP NEED IT URGENT PLZ :D
The program is binary tree
):P
Ive put the attachment plz solve it for :D
#include<iostream>
#include<cmath>
using namespace std;
struct node
{
int ele[4];
int child[4];
};
class btree
{
public:
node *tree[10][10];
int count[10];
int leaf;
int path[10];
btree();
node*create();
void insert(int);
void main_ser(int);
void display();
void ins_node(node*,int);
void ser(int);
int ser_node(node*,int);
int nodefull(node*);
void split(node*);
};
btree::btree()
{
leaf=-1;
for(int i=0;i<10;i++)
{
count[i]=-1;
path[i]=-1;
}
}
node*btree:: create()
{
node *n;
n=new node;
for(int i=0;i<4;i++)
{
n->ele[i]=-1;
n->child[i]=-1;
}
return n;
}
void btree::insert(int key)
{
int n,parent;
node *first_node;
if(leaf==-1)
{
first_node==create();
tree[0][0]=first_node;
leaf++;
count[0]++;
first_node->ele[0]=key;
}
else if(leaf==0)
{
if(nodefull(tree[0][0]))
{
path[leaf]=0;
split(tree[0][0]);
insert(key);
}
else
ins_node(tree[0][0],key);
}
else
{
ser(key);
n=path[leaf];
parent=path[leaf-1];
if(nodefull(tree[leaf][n]))
{
split(tree[leaf][n]);
insert(key);
}
else
ins_node(tree[leaf][n],key);
}
}
void btree::main_ser(int key)
{
int flag=0,i;
node *node1;
ser(key);
node1=tree[leaf][path[leaf]];
for(i=0;node1->ele[i]!=-1;i++)
if(node1->ele[i]==key)
{
flag=1;
break;
}
cout<<"\n the path traversed is ";
for(i=0;path[i]!=-1;i++)
cout<<path[i]<<"->";
if(flag)
cout<<"\n element found";
else
cout<<"\n not found";
}
void btree:: display()
{
int i,j,k;
for(i=0;i<=leaf;i++)
{
cout<<"\n level -----"<<i<<"\n";
for(j=0;j<=count[i];j++)
{
for(k=0;tree[i][j]->ele[k]!=-1;k++)
cout<<" "<<tree[i][j]->ele[k];
cout<<"\t";
}
}
}
void btree:: ser(int key)
{
int i,j,temp;
path[0]=0;
if(leaf)
{
j=0;
for(i=0;i<leaf;i++)
{
temp=ser_node(tree[i][j],key);
path[i+1]=temp;
j=temp;
}
}
}
int btree:: ser_node(node *node1,int key)
{
for(int i=0;i<4;i++)
{
if(key<=node1->ele[i])
return node1->child[i];
else if(node1->ele[i+1]==-1)
return node1->child[i];
}
}
int btree:: nodefull(node *node1)
{
if(node1->ele[3]!=-1)
return 1;
else
return 0;
}
void btree::ins_node(node *node1,int key)
{
int flag=0,count=-1,i,j,x,y,t;
node *newnode,*n1;
for(i=0;i<4;i++)
if(node1->ele[i]!=-1)
++count;
i=0;
while(!flag && node1->ele[i]!=-1)
{
if(node1->ele[i]>key)
{
flag=1;
for(int j=count;j>=i;j--)
node1->ele[j+1]=node1->ele[j];
node1->ele[i]=key;
}
i++;
}
if(!flag)
{
node1->ele[count+1]=key;
for(i=leaf-1;i>=0;i--)
{
n1=tree[i][path[i]];
for(t=0;n1->ele[t]!=-1;t++);
n1->ele[t-1]=key;
}
}
for(i=0;i<=count+1;i++)
cout<<"\t\t"<<node1->ele[i];
}
void btree:: split(node *oldnode)
{
node *newnode,*parent,*n1,*n2;
int i,j,k,n,t,x,y,pos;
newnode=create();
newnode->ele[0]=oldnode->ele[2];
newnode->ele[1]=oldnode->ele[3];
oldnode->ele[2]=-1;
oldnode->ele[3]=-1;
t=count[leaf];
n=path[leaf];
for(i=t,j=t+1;i>n;i--,j--)
tree[leaf][j]=tree[leaf][i];
tree[leaf][n+1]=newnode;
count[leaf]++;
x=leaf;
if(count[leaf]+1==1)
t=1;
else
t=log(count[leaf]+1)/log(2);
if(t!=leaf)
{
++leaf;
count[leaf]=count[x];
for(i=0;i<=count[leaf];i++)
std::swap(tree[leaf][i],tree[x][i]);
}
for(i=leaf-1;i>=0;i--)
count[i]=-1;
for(i=t,j=i-1;i>0;i--,j--)
{
for(k=0;k<(count[i]+1)/2;k++)
{
n1=tree[i][2*k];
n2=tree[i][(2*k)+1];
for(x=0;n1->ele[x]!=-1;x++);
for(y=0;n2->ele[y]!=-1;y++);
newnode=create();
count[j]++;
tree[j][count[j]]=newnode;
newnode->ele[0]=n1->ele[x-1];
newnode->child[0]=2*k;
newnode->ele[1]=n2->ele[y-1];
newnode->child[1]=(2*k)+1;
}
if(count[i]!=1&&count[i]%2==0)
{
n2=tree[i][count[i]];
newnode->ele[2]=n2->ele[y-1];
newnode->child[2]=count[i];
}
}
}
int main()
{
btree bt;
int ch,key;
while(1)
{
cout<<"\n\n\n MAIN MENU\n ---------------\n1.insert\n2.search\n3.display\n4.exit\n\nENter ur choice";
cin>>ch;
switch(ch)
{
case 1: cout<<"\n enter the element";
cin>>key;
bt.insert(key);
break;
case 2: cout<<"enter a key";
cin>>key;
bt.main_ser(key);
break;
case 3:bt.display();
break;
case 4: return 0;
default:cout<<"\n enter the valid choice";
}
}
}
The program is binary tree
):P
Ive put the attachment plz solve it for :D
#include<iostream>
#include<cmath>
using namespace std;
struct node
{
int ele[4];
int child[4];
};
class btree
{
public:
node *tree[10][10];
int count[10];
int leaf;
int path[10];
btree();
node*create();
void insert(int);
void main_ser(int);
void display();
void ins_node(node*,int);
void ser(int);
int ser_node(node*,int);
int nodefull(node*);
void split(node*);
};
btree::btree()
{
leaf=-1;
for(int i=0;i<10;i++)
{
count[i]=-1;
path[i]=-1;
}
}
node*btree:: create()
{
node *n;
n=new node;
for(int i=0;i<4;i++)
{
n->ele[i]=-1;
n->child[i]=-1;
}
return n;
}
void btree::insert(int key)
{
int n,parent;
node *first_node;
if(leaf==-1)
{
first_node==create();
tree[0][0]=first_node;
leaf++;
count[0]++;
first_node->ele[0]=key;
}
else if(leaf==0)
{
if(nodefull(tree[0][0]))
{
path[leaf]=0;
split(tree[0][0]);
insert(key);
}
else
ins_node(tree[0][0],key);
}
else
{
ser(key);
n=path[leaf];
parent=path[leaf-1];
if(nodefull(tree[leaf][n]))
{
split(tree[leaf][n]);
insert(key);
}
else
ins_node(tree[leaf][n],key);
}
}
void btree::main_ser(int key)
{
int flag=0,i;
node *node1;
ser(key);
node1=tree[leaf][path[leaf]];
for(i=0;node1->ele[i]!=-1;i++)
if(node1->ele[i]==key)
{
flag=1;
break;
}
cout<<"\n the path traversed is ";
for(i=0;path[i]!=-1;i++)
cout<<path[i]<<"->";
if(flag)
cout<<"\n element found";
else
cout<<"\n not found";
}
void btree:: display()
{
int i,j,k;
for(i=0;i<=leaf;i++)
{
cout<<"\n level -----"<<i<<"\n";
for(j=0;j<=count[i];j++)
{
for(k=0;tree[i][j]->ele[k]!=-1;k++)
cout<<" "<<tree[i][j]->ele[k];
cout<<"\t";
}
}
}
void btree:: ser(int key)
{
int i,j,temp;
path[0]=0;
if(leaf)
{
j=0;
for(i=0;i<leaf;i++)
{
temp=ser_node(tree[i][j],key);
path[i+1]=temp;
j=temp;
}
}
}
int btree:: ser_node(node *node1,int key)
{
for(int i=0;i<4;i++)
{
if(key<=node1->ele[i])
return node1->child[i];
else if(node1->ele[i+1]==-1)
return node1->child[i];
}
}
int btree:: nodefull(node *node1)
{
if(node1->ele[3]!=-1)
return 1;
else
return 0;
}
void btree::ins_node(node *node1,int key)
{
int flag=0,count=-1,i,j,x,y,t;
node *newnode,*n1;
for(i=0;i<4;i++)
if(node1->ele[i]!=-1)
++count;
i=0;
while(!flag && node1->ele[i]!=-1)
{
if(node1->ele[i]>key)
{
flag=1;
for(int j=count;j>=i;j--)
node1->ele[j+1]=node1->ele[j];
node1->ele[i]=key;
}
i++;
}
if(!flag)
{
node1->ele[count+1]=key;
for(i=leaf-1;i>=0;i--)
{
n1=tree[i][path[i]];
for(t=0;n1->ele[t]!=-1;t++);
n1->ele[t-1]=key;
}
}
for(i=0;i<=count+1;i++)
cout<<"\t\t"<<node1->ele[i];
}
void btree:: split(node *oldnode)
{
node *newnode,*parent,*n1,*n2;
int i,j,k,n,t,x,y,pos;
newnode=create();
newnode->ele[0]=oldnode->ele[2];
newnode->ele[1]=oldnode->ele[3];
oldnode->ele[2]=-1;
oldnode->ele[3]=-1;
t=count[leaf];
n=path[leaf];
for(i=t,j=t+1;i>n;i--,j--)
tree[leaf][j]=tree[leaf][i];
tree[leaf][n+1]=newnode;
count[leaf]++;
x=leaf;
if(count[leaf]+1==1)
t=1;
else
t=log(count[leaf]+1)/log(2);
if(t!=leaf)
{
++leaf;
count[leaf]=count[x];
for(i=0;i<=count[leaf];i++)
std::swap(tree[leaf][i],tree[x][i]);
}
for(i=leaf-1;i>=0;i--)
count[i]=-1;
for(i=t,j=i-1;i>0;i--,j--)
{
for(k=0;k<(count[i]+1)/2;k++)
{
n1=tree[i][2*k];
n2=tree[i][(2*k)+1];
for(x=0;n1->ele[x]!=-1;x++);
for(y=0;n2->ele[y]!=-1;y++);
newnode=create();
count[j]++;
tree[j][count[j]]=newnode;
newnode->ele[0]=n1->ele[x-1];
newnode->child[0]=2*k;
newnode->ele[1]=n2->ele[y-1];
newnode->child[1]=(2*k)+1;
}
if(count[i]!=1&&count[i]%2==0)
{
n2=tree[i][count[i]];
newnode->ele[2]=n2->ele[y-1];
newnode->child[2]=count[i];
}
}
}
int main()
{
btree bt;
int ch,key;
while(1)
{
cout<<"\n\n\n MAIN MENU\n ---------------\n1.insert\n2.search\n3.display\n4.exit\n\nENter ur choice";
cin>>ch;
switch(ch)
{
case 1: cout<<"\n enter the element";
cin>>key;
bt.insert(key);
break;
case 2: cout<<"enter a key";
cin>>key;
bt.main_ser(key);
break;
case 3:bt.display();
break;
case 4: return 0;
default:cout<<"\n enter the valid choice";
}
}
}