Calling The Global Function

#include<iostream>
using namespace::std;

template<class T>
class List
{
    public:
    List(int size);
    ~List();
    void insert(const T value);
    bool remove(const T value);
    void setData(int index, T value);
    T getData(int index);
    int search(T key); // linear search
    bool isFull();
    bool isEmpty();
    int length();
    List(const List &other); // copy construct
    const List &operator=(const List &rhs);

    private:
    bool removeAt(int index);

    int MaxSize;
    T * listarray;
    int mSize;
};
template<class T>
int List<T>::length()
{
    return mSize;
}
template<class T>
List<T>::~List()
{
    delete [] listarray;
}
template<class T>
T List<T>::getData(int index)
{
    if (index < 0 || index >= mSize) throw "Index ! Positive";
    return listarray[index];
}
template<class T>
List<T>::List(int size)
{
    if(size < 1) throw "ILLEGAL_SIZE";
    else
    {
        MaxSize = size;
        listarray = new T[MaxSize];
        if(listarray == NULL) throw "OUT_OF_MEMORY";
        mSize = 0;
    }
}
template<class T>
void List<T>::insert(const T value)
{
    if(isFull()) throw "OUT_OF_SPACE";
    listarray[mSize] = value;
    mSize++;
}
template<class T>
bool List<T>::remove(const T value)
{
    int index = search(value);
    if(index == -1)
    return false;
    else return removeAt(index);
}
template<class T>
bool List<T>::removeAt(int index)
{
    if(index <0 || index >= mSize)
    throw "ILLEGAL_INDEX";
    for(int i = index; i < mSize - 1; i++)
        listarray[i] = listarray[i+1];
        mSize--;
        return true;
}
template<class T>
bool List<T>::isFull()
{
    return mSize == MaxSize;
}
template<class T>
bool List<T>::isEmpty()
{
    return mSize == 0;
}
template<class T>
int List<T>::search(T key)
{
		for (int i = 0; i < mSize; i++)
		{
			if (key == listarray[i])
			{
				key = i;
			}
		}
		return key;
}
template<class T>
void fetch(T mylist, int length)
{
	 for(int j = 0; j < length; j++)
        {
            cout << mylist.getData(j) << endl;
        }
        cout << endl;
}

int main()
{
    const int length = 3;
    try
    {
		List<int> mylist(length);
		label:
        for(int i = 0; i < length; i++)
        {
            int temp;
			cout << "Enter Element # " << i +1 << ": ";
            cin >> temp;
            mylist.insert(temp);
        }
        cout << endl;
		
		fetch(mylist, length);
       
		int key;
		cout << "Enter Key To Search: "; cin >> key;
		int key_index = mylist.search(key);
		if (key_index == -1)
			cout << "Key Not Present In The List :(" << endl;
		else
        cout << "Key Present @: " << key_index + 1 << endl;
		cout << "Priting The List " << endl;
		// OR should I write goto statement :? 
    }
	


    catch(...)
    {
        cout << "Something Else Happened .. !!" << endl;
    }
    return 0;
}