public static void traverseTree(ArrayList<String> r, TreeNode root) {
		if(root.isLeaf()){			
			int key = Integer.parseInt(r.get(indexOfClassLabel));
			if(key == Integer.parseInt(root.getLeafAttribute())){
				count++;
				if(!prediction.containsKey(key))
					prediction.put(key, 1);
				else
					prediction.put(key, prediction.get(key)+1);
			}
			else{
				//System.out.println("Incorrect Prediction for "+r.toString()+" --> "+root.getLeafAttribute());
				if(!prediction.containsKey(key))
					prediction.put(key, 0);
			}
		}
		else{
			int testAttr = root.getTestAttribute();
			int inputAttr = Integer.parseInt(r.get(testAttr));
			if(root.getChildren() != null){
				if(inputAttr == Integer.parseInt(root.getTestValue()[0])){
					traverseTree(r, root.getChildren()[0]);
				}
				else{
					traverseTree(r, root.getChildren()[1]);
				}
			}
		}		
		return;
	}