BstNode* Search(BstNode* root, int key)
{
    if (root == NULL || root->data == key)
    {
        return root;
    }
    if (root->data < key)
    {
        return Search(root->right, key);
    }
    else
    {
        return Search(root->left, key);
    }
}