void printFullNode( Node node )
	{
	   int start, end;
	   if ( node != null )
	   {
		   // calculating the beginning and ending of the last edge
		   start = node.edgeLabelStart;
		   end = getNodeLabelEnd( node );
		   
		   // stopping condition - the root
		   if ( node.father != root )
		      printFullNode( node.father );
		   // print the last edge
		   while ( start <= end )
		   {
		      System.out.print(treeString[start]);
		      start++;
		   }
	   }
	}