Question

need c++ format

need SkipListNode.h & .cpp and main.cpp

**********************************************************

1.3 The Skip List's Node Class Each node of a skip list must be capable of pointing to multiple sucessors in the skip list structure. This could be accomplished with an array of pointers of fixed size, but this is wasteful in terms of storage since the size would have to be large enough to accommodate the biggest possible skip list. It is more efficient to the skip list itself just prior to the creation of the node. The number of next pointers can be passed to the skip list node constructor along with the value to be stored. Note that the pointer access methods must y allocate an array of pointers for the node based on information which can be determined by specify one of the next pointers; the number of pointers in the node's array should be stored so that the access methods can verify legitimate requests

Answer 1

ANSWER:

Code in C++. Tested on Microsoft Visual Studio.

#include<iostream>
using namespace std;

/*
*class that represent the Skip list node
*where each node contains data of type double
*and variable number of pointers to the same
*class
*/
class SkipListNode{
   double data;
   SkipListNode** next;//pointer of pointers
   int size;//size of array of pointers
public:
   /*
   *constructor that accepts @value as data in the node
   *and @size as number of pointers
   */
   SkipListNode(double value,int size){
       data = value;
       next = new SkipListNode*[size];
       for (int i = 0; i < size; i++){
           next[i] = nullptr;
       }
       this->size = size;
   }
   /*
   *method to set the next pointers at @index with given node
   *@address
   */
   void setNext(int index, SkipListNode*address){
       next[index] = address;
   }
   /*
   *method to display the information in the node
   */
   ostream & write(ostream& out){
       out << data;
       for (int i = 0; i < size; i++){
           if (next[i] != nullptr){
               out << " ( " << next[i]->data << " )";
           }
           else{
               out << " ( / )";
           }
       }
       return out;
   }
   friend ostream & operator << (ostream& out, SkipListNode& node);
};
//<< operator overloaded to print SkipListNode class object
ostream & operator << (ostream& out, SkipListNode& node){
   return node.write(out);
}
int main(){
   SkipListNode n1(103, 3);
   SkipListNode n2(201, 1);
   cout << "w/o setNext :   " << n1 << endl<<"       "<<n2<<endl;
   n1.setNext(0, &n2);
   cout << "w/ setNext :   " << n1 << endl << "       " << n2 << endl;
   getchar();
   return 0;
}

Output:

w/o setNext :   103 ( / ) ( / ) ( / )
                       201 ( / )
w/ setNext :   103 ( 201 ) ( / ) ( / )
                      201 ( / )