Returning an Array?

void LinkedList::convertToHash(LinkedList list){
     Node* current= list.getFirst();
     Node* nodeArray[63];           //creates Hash Table of 63 elements
     
     for(int i=0;i<63;i++)  //set each array value to null, allows to check for
     {                            //empty spaces. Helps linear probing.      
             nodeArray[i]= 0;
     }
             
     int noOfNodes= list.countNodes();

     for(int i=0; i<noOfNodes; i++)
     {
             int index= ((current->gridReference %1000)%63); //folding &
                                                             //modular arithmetic
             if(nodeArray[index]==0)
             {
                  nodeArray[index]=current;
                  current= current->link;
             }
             else
             {
                 while(nodeArray[index]!=0)   //heres where linear probing occurs.
                 {
                        index++;
                        index= index%63;  //used to make the array circular
                                          //no array out of bounds errors.
                 }
                 nodeArray[index]=current;
                 current= current->link;
             }
     }

   
     for(int j=0;j<63;j++)  //prints the hash table
     {
             if(nodeArray[j]!=0)
             {
                   cout<<"Height: "<<nodeArray[j]->height<<endl;
                   cout<<"Distance from Home: "<<nodeArray[j]->distanceFromHome<<endl;
                   cout<<"Climbed: "<<nodeArray[j]->climbed<<endl;
                   cout<<"Grid Ref: "<<nodeArray[j]->gridReference<<endl;
                   cout<<"-------------------"<<endl;
                   cout<<endl;
             }
     }
   
   
}

class Foo {
public:
    int value;
};

Foo** test() {
    // Totally forgot about that
    Foo* bar = new Foo[50];

    Foo* first = new Foo();
    first->value = 1337;
    bar[0] = first;

    return bar;
}

int main(){
    Foo** foobar = test();

    printf("It's %i\n", foobar[0]->value );
    return 0;
}

Node* pNodes = new Node[NUM_NODES] ;
// do whatever you must to contents of pNodes, then delete it when you're done.
delete[] pNodes ;

267 C:\Documents and Settings\Scott\Desktop\Objects and Algorthms Project\LinkedList.cpp no match for 'operator=' in '*((+(((unsigned int)i) * 24u)) + nodeArray) = 0'