[AED020] Returning an element on a given position

In what concerns the continuous evaluation solving exercises grade during the semester, you should submit until 23:59 of November 9th
(this exercise will still be available for submission after that deadline, but without couting towards your grade)
[to understand the context of this problem, you should read the class #05 exercise sheet]

In this problem you should only submit a singlyLinkedList.h file with a self-containing definition of a class SinglyLinkedList<T>

Base Code

Use as a basis the class SinglyLinkedList<T> (see code | download code) which implements a generic singly linked list similar to what was done on classes, with methods to add and remove an element in the end, return the size, knowing if the list is empty or printing the list.

The Problem

Add a new method T & get(int pos) to the class. The function should return a reference to the value of the node in position pos (with the positions starting in zero). You may assume that your method will always be called with a valid position, that is, it always happen that 0<pos<length.

Submission

You should submit the file singlyLinkedList.h with the method get added to SinglyLinkedList<T> as requested (and without removing any of the other existing methods). You can however create additional methods, if you need them.

Mooshak will use the following code to link to your class, read the inputs, build the lists and call your method, printing its result.

#include <iostream>
#include <string>

#include "singlyLinkedList.h"

// Read n and then n elements to add to the list using addFirst, followed by
// Read q and then q queries q_i to call get(q_i)
template <typename T>
void read() {
  int n;
  std::cin >> n;
  SinglyLinkedList<T> lst;
  for (int i=0; i<n; i++) {
    T v;
    std::cin >> v;
    lst.addFirst(v);
  }
  std::cout << "lst = " << lst.toString() << " | size = " << lst.size() << std::endl;
  std::cin >> n;
  for (int i=0; i<n; i++) {
    int q;
    std::cin >> q;
    std::cout << "lst.get(" << q << ") = " << lst.get(q) << std::endl;
  }   
}

int main() {

  int n;
  std::cin >> n;
  for (int i=0; i<n; i++) {
    std::string type;
    std::cin >> type;
    if (type == "int") read<int>();
    else if (type == "char") read<char>();
    else if (type == "string") read<std::string>();
  }
  
  return 0;
}