Implement min-heap data structure named as MinHeap for maintaining a list of integer keys with the following methods: 

void insert(int val); // inserts an element into heap

int getMin(); // retrieves the minimum element

int removeMin(); // retrieves and removes the minimum element

int getSize(); // returns the number of elements in heap