C / C++ / MFC

struct stars
{
	char name[25];
	char designation[12];
	char constellation[3];
	unsigned int right_asc_one;
	unsigned int right_asc_two;
	signed int decline_one;
	unsigned int decline_two;
	float vis_magnitude;
};

void BinaryTree::InsertNode(stars value)
{
	TreeNode *newNode,			// Pointer to a new node
		     *nodePtr;			// Pointer to traverse the tree

	// Create a new node
	newNode = new TreeNode;

	// Copy values from stars struct into new node.
	strcpy(newNode->value.name, value.name);
	strcpy(newNode->value.designation, value.designation);
	strcpy(newNode->value.constellation,value.constellation);
	newNode->value.right_asc_one = value.right_asc_one;
	newNode->value.right_asc_two = value.right_asc_two;
	newNode->value.decline_one = value.decline_one;
	newNode->value.decline_two = value.decline_two;

	// Set the left and right pointers to NULL.
	newNode->left = newNode->right = NULL;

	if (!root)	// Is the tree empty?
		root = newNode;
	else
	{
		nodePtr = root; 
		while (nodePtr != NULL)
		{
			if (strcmp(value.name,nodePtr->value.name) < 0)
			{
				if (nodePtr->left)
					nodePtr = nodePtr->left;
				else
				{
					nodePtr->left = newNode;
					break;
				}
			}
			else if (strcmp(value.name,nodePtr->value.name) > 0)
			{
				if (nodePtr->right)
					nodePtr = nodePtr->right;
				else
				{
					nodePtr->right = newNode;
					break;
				}
			}
			else
			{
                                     // always being hit after the second insert call.
				cout << "Duplicate value found in tree.\n"; 				
break;
			}
		}		
	} // end of while loop
} //end of function

Not everything that can be counted counts, and not everything that counts can be counted. - Albert Einstein