public void readFromUser(BinarySearchTree<String, String,String> tree, int size) {

		Scanner inn = new Scanner(System.in);
    	String compare ="N";
    	String comText= null;
    	String name = null;
    	String roll = null;
    	String address = null;
    		
   		do {
   			System.out.println("\n\nEnter the fullName, rollNo as (DW-2XX)  and address:");
   			name = inn.nextLine();
   			
   			roll = inn.next();
   			
   			address = inn.next();
   			
   			tree.add(name,roll,address);
   			
   			System.out.println("Want to continue?? Enter Y for yes and N for no:");
   			comText = inn.next();
   		
   		}while(!comText.equalsIgnoreCase(compare));
    	
   		List<BinaryNode<String, String,String>> li = tree.inOrder(tree.returnRoot());
    			
        for(int i = size; i<li.size()-size; i++){
              serialize(li.get(i).key,li.get(i).value,li.get(i).address);
        }
        
        List<String> m = tree.inOrderWithInformation(tree.returnRoot());
        TreeSet<String> myTreeSet = new TreeSet<String>(m);
        System.out.println("\nThere are "+myTreeSet.size()+" different locations.");
        for (String str : myTreeSet) {
			System.out.println(str);
		}
        
        String[] result = myTreeSet.toArray(new String[myTreeSet.size()]);
        Set<String> ts = new TreeSet<String>();
        ts.addAll(Arrays.asList(result));
        Iterator<String> itr = ts.iterator();
        int i =1;
        while(itr.hasNext()){
        	String s = itr.next();
        	
        	System.out.println("\n"+i+".The person living in "+s+" are:");
        	visitNode(root,s);
        	i++;
        }
        System.out.println("\n");
        
            
        inn.close();
    	    	    
    }