public void goBottom()
	{
		nNode = top; 
		sRecno = 0;
		found = false;
		
		for(;;)
			{
			goNode();
			readPage();
			if(right_page>0) nNode=right_page;
			else
				{
				for(;;)
					{
					if(key_cnt>0 || left_page<0) break;
					nNode = left_page;
					goNode();
					readPage();
					}
				nKey = key_cnt-1;
				if(LEAF)
					{
					found = true;
					sRecno = pgR[nKey];
					break;
					}
				else nNode = pgR[nKey];
				}
			}
	}