NodeT* searchKey(NodeT *root, int key) {
    if(root == NULL || root->key == key)
        return root;
    if(root->key < key)
        return searchKey(root->right, key);
    return searchKey(root->left, key);
}