Binary Search Tree Algorithm C++

Write an array-based implementation of Binary Search Tree (BST) named as AbBST for maintaining a list of integer keys. Implement only insert and getHeight methods for AbBST class.

The initial size of the array is two. During insertion, if there is no more empty space left in the array, you should double the array size.

Prototypes of required methods:

void insert(int val);

int getHeight();