C / C++ / MFC

typedef struct node {
  char *sData;                         // Data stored in node
  int iNumChildren;                    // Number of children of node
  struct node *nParent;                // Pointer to parent of node
  struct node *nChildren[MAX_NODES];   // MAX_NODES pointers to child nodes
} treeNode;

struct node* addNode(struct node *nParent, char *sData)
{
	treeNode *temp;
	int iNodeLevel;

	if( nParent->iNumChildren < MAX_NODES )
	{
		// Allocate memory for new node
		temp = malloc( sizeof( treeNode ) );
		// Set up new node's data
		temp->sData = sData;
		
		...
		
		return temp;
	}
	else
	{
		return NULL;
	}
}

void freeTree()
{
	int iRep;
	int iFreed = 0;
	char *sData;
	treeNode *temp;
	
	while( getNumChildren( root ) > 0 )
	{
		// Set temp to the last child of root
		temp = root->nChildren[ root->iNumChildren - 1 ];

		for( iRep = 0; iRep < iLongestPath; iRep++ )
		{
			if( getNumChildren( temp ) > 0 )
				temp = temp->nChildren[ temp->iNumChildren - 1 ];
		}

		// We're now at the bottom of this particular branch, decrement parent's child count, then free
		temp->nParent->iNumChildren--;
		sData = temp->sData;
		// This didn't work
		//free( temp->sData );
		free( temp );
		iFreed++;
		printf( sData );
	}

	free(root);
	iFreed++;

#ifdef _DEBUG
	printf( "Freed %d nodes\n", iFreed );
#endif
}