Question

PROGRAMMING 1. The LinkList class that we discussed in class is implemented using pointer t constructed with a list of nodes, and the first node pointer points to the front I a) (10 pts) Complete the following class declaration which is similar to Linklist class ecter class (Write only the prototypes and the private data field; definitions will follow the class declaration) template stypenane T> olass Linkedveoter t private olass Node publie T info Node "next typedet Node *nodePtr publie LinkedVector ) bool emptyo //constructor //determine if the LinkedVector is empty void Push back(T stem) //add an item at the back //returns the front item T Frontt) T Back( int Length) //returns the back item //returns the number of items in the object //copy constructor //overloaded assignment operator //destructor //At (int n) function, which returns the element at position n in //the LinkedVector. The parameter is the position of an element //in the LinkedVector. The return value is the element at the //specified position in the LinkedVector. // Pop_ back) function, which removes the last item of the // Linkedvector private: // node pointer which points to the front (first node)

Answer 1

(A)

public:

    // copy constructor

    LinkedVector( const LinkedVector& ob );

    // overload assignment operator

    LinkedVector& operator=(const LinkedVector& ob);

    // destructor

    ~LinkedVector();

    T At( int n );

    // remove the last node in the list

    void pop_back();

private:

   

    // point to the first node

    Node *front;

(B)

T At(int n)

{

    // if entered position is invalid

    if( n <= 0 || n >= length )

        return NULL;

   

    // point trav to the first node

    Node *trav = this->first;

   

    int i = 1;

   

    // traverse the list

    while( !trav )

    {

        // if the current node is the required node

        if( i == n )

            return trav->info;

       

        // go to next node

        trav = trav->next;

    }

   

    return NULL;

}

int Length()

{

    // point trav to the first node

    Node *trav = this->first;

   

    // store the length of list

    int i = 0;

   

    // traverse the list

    while( !trav )

    {

        i++;

       

        // go to next node

        trav = trav->next;

    }

   

    return i;

}

void Push_back(T item)

{

    // create a new node

    Node *new_node = new Node();

   

    // set the value of node

    new_node->info = item;

   

    new_node->next = this->front;

   

    // make new_node as the new front of the list

    this->front = new_node;

}

(C)

template<typename T>

void split(LinkedVector<T> aVec, LinkedVector<T> &v1, LinkedVector<T> &v2, T pivotal)

{

    int i;

   

    // traverse aVec

    for( i = 1 ; i <= aVec.Length() ; i++ )

    {

        // get the elemeny at position i

        T x = aVec.At( i );

       

        if( x < pivotal )

            v1.Push_back( x );

        else

            v2.Push_back( x );

    }

}