public  int deserialize(BinarySearchTree<String, String, String> tree) {
    	Properties prop = new Properties();
    	InputStream istream = getClass().getClassLoader().getResourceAsStream("com/file/resources/additionalsearchtree.properties");
    	List<BinaryNode<String, String,String>> li = null;
    	
    	try {
    		prop.load(istream);
    		String pathLocation = prop.getProperty("path");
    		
            BufferedReader br = new BufferedReader(new FileReader(pathLocation));
            String line = br.readLine();
            int count=1;
            
            while(line!=null){
               
               for(int i=0;i<count;i++){
            	   String[] parts = line.split("\\|");
            	   if(parts[i].equals("name") && parts[i+1].equals("rollnumber") && parts[i+2].equals("address")){
            		   continue;
            	   }else{
            		   tree.add(parts[i], parts[i+1], parts[i+2]);
            	   }
            	   
               }
               line=br.readLine();
           }
                       
            
            
  
            System.out.println("Inorder traverse:");
            li = tree.inOrder(tree.returnRoot());
           
           
            br.close();
           
       } catch (Exception e) {
           e.printStackTrace();
       }
		return li.size();
		
	}