boolean leaf()
	{
		int count = 0;
		if ( null != parentEdge)
			count++;
		if ( null != leftEdge)
		    count++;
		if ( null != rightEdge)
		    count++;
		if ( null != middleEdge)
		    count++;
		if ( count > 1 )
			return false;
		return true;
	}