望高手帮忙看看那里错了

#include<iostream>

//定义结点类
class node
{
private:
friend class slist;
int data;
node *next;
public:
node(int a)
{
data=0;
next=new node(0);
}
~node()
{
delete []next;
}
};

//定义单链表类
class slist
{
node *head;//是头指针。
int size;//用来表示当前链表长
public:
slist(int a[],int i);
~slist();
node* index(int i);//用来查找相应的结点
bool charu(int i,int &elem);//在i个位置处插结点elem
};

slist::slist(int a[],int i)
{
node *p;
int j;
head=new node(0);
for(j=0;j<i;j++)
{
p=new node(0);
p->data=a[j];
p->next=head->next;
head->next=p;
}
size=i;
}
slist::~slist()
{
delete []head;
}
//现在是功能函数index
node *slist::index(int i)
{
node *p;
int j;
if(i<1||i>size)
return 0;
else
{
p=head->next;
while(j!=i)
{
p=p->next;
}
}
std::cout<<"you want element whose number is:"<<p->data<<std::endl;
return p;
}
bool slist::charu(int i,int &elem)
{
node *p;
if(i<1||i>size)
return false;
else
{
p=index(i);
p->next=head->next;//
head->next=p;//
}
return true;
}
int slist::show()
{


return 0;
}

//main函数
int main()
{
int n=15;
int k=5;
int shuzu[]={1,2,3,4,5,6,7,8,9};
slist geek(shuzu,n);
geek.index(4);
geek.charu(3,k);


return 0;
}

可以通过编译就是没有显示。调试时总报错