void TraverseTreeRecursively(Node* currentNode)
{
      if (currentNode != nullptr)
      {
      TraverseTreeRecursively(currentNode->leftNode)
      sortedArray[arrayIndex++] = currentNode->value;
      TraverseTreeRecursively(currentNode->rightNode)
      }
}
sortedArray и arrayIndex являются полями