Which XXX completes the leaf removal case in the C++ BinarySearchTree class's Remove() function? if (currentNode->left == nullptr && currentNode->right == nullptr) { if (parent == nullptr) { root = nullptr; } else if (parent->left == currentNode) { parent->left = nullptr; } else { parent->right = nullptr; } XXX return true; }