Programming language: C++

QUESTION:

How do I implement the following method using a recursive helper in a way that the resulting binary tree stays balanced?

The following method is for a Binary Tree:

template

void BinaryNodeTree::setRootData(const ItemType& newltem)

{

if (isEmpty())

rootPtr = new BinaryNode(newltem, nullptr, nullptr);

else

rootPtr->setItem(newItem);

}