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