链表的递归运算

#include<iostream>
using namespace std;

class node{
public:
    node():value(0),next(NULL){}
    ~node(){}
    int value;
    node* next;
};///be careful this ;

node* createlist(int a[],int n)
{
 node* startnode = new node[n];
 node* ret = startnode;
 for(int i = 0;i<n;i++)
 {
     startnode[i].value = a[i];
     if(i<n-1) 
         startnode[i].next = startnode + i + 1;
 }
 while(startnode)
 {
     cout<<" "<<startnode->value;
     startnode = startnode->next;
 }
 cout<<endl;
 return ret;
}

int helper(node* head)
{
    if(head->next == NULL)
      return 1;
    else
      return helper(head->next) + 1;
}
 
int helper2(node* head)
{
    if(head != NULL)
        {
            helper2(head->next);
            cout<<head->value<<" ";
        }

}

int main()
{
    int a[] = {1,2,3,4,5,6,7,8,9};
    node * t = createlist(a,9);
    cout<<helper(t);

}