If I can't implement a perfect hashed algorithm without using a Hashtable or HashMap, then how is it possible to implement this type of data structure? Any resources that help or any suggestions? Thanks! I know I probably can have something like this: 

public class PerfectHashed{
*
int ticketNumber; // keyfield
String PurchaserName; 
*
input(){
*
// key values ranges between 2000 to 100, 000 
*
System.out.print("Please enter a ticket number between 2000 to 100,000: " ); 
*
// to hold there answer.
number= nextInt; 
*
}
 // Then I also would need to have four basic operations in my application:  
*
 
// the insert direct hashed algorithm 
*
    pseudoKey = preProcessing(targetKey); 
  ip = pseudoKey; // direct hashing function 
 
// insert the new node
data[ip]= newNode.deepCopy(); 
*
 
*
  // the fetch algorithm 
 // access the primary storage area 
*
 pseudoKey = preprocessing(targetKey); 
ip = pseudoKey; // direct hashing function 
if(null[ip] = = null)
 { return null; } 
else{return   data[ip].deepCopy(); 
}
*
 
  // the delete direct hashed algorithm 
*
 // access the primary storage area 
 pseudoKey = preprocessing(targetKey); 
ip = pseudoKey; // direct hashing function 
*
if(null[ip] = = null)
 { return false; } 
else 
  { data[ip]=null;                      
      return true; }
} 
*
 
// the update direct hashed algorithm 
if(delete(targetKey) == false)
    return false; 
 else 
 {insert(newNode) return true; }