树的层次遍历

void TraverseLevel(Node* Node, int depth)
{
	if(Node == NULL)
	{
		return;
	}
	else
	{
		if(depth == 0)
		{
			printf("%d", Node->value);
		}
		else
		{
			TraverseLevel(Node->left, depth - 1);
			TraverseLevel(Node->right, depth - 1);
		}	
	}
}