@Override
	public Integer getResult(K[] kArray) {
		if(kArray==null || kArray.length<=0)
			return getCount();
		
		CountTree<K> tempCountTree = new CountTree<K>(kArray[0]);
		
		for(CountTree<K> countTree: children){			//Searching tempHST
			if(tempCountTree.equals(countTree)){
				return countTree.getCount(kArray, 0);				//Start to searching accumulated value from this SumTree
			}
		}
		return 0;		//If not exist
	}