void printByLevelsHelper(TreeNode *root)//using the bsf algroithm to go through the tree
{
	TreeNode* arr[SIZE]={0};//help array of treenodes(size is 20 for this spec. tree(you can change the size on the define for larger trees).
	int size=0,index=0;
	while(root)
	{
		printf("%d ",root->data);
		if(root->left)
			arr[size++] = root->left;
		if(root->right)
			arr[size++] = root->right; 
		root = arr[index++];    
	}
}
void printByLevels(Tree tr)
{
	if(!tr.root)//empty tree check
		return;
	else
		printByLevelsHelper(tr.root);
}
[\code]