<awangdev>Path Sum IV_1.java
private int dfs(Map<Integer, Integer> map, int key, int sum) {

        sum += map.get(key); 

        int level = key / 10;
        int position = key % 10;
        int leftChildKey = (level + 1) * 10 + position * 2 - 1;
        int rightChildKey = leftChildKey + 1;
    
        if (!map.containsKey(leftChildKey) && !map.containsKey(rightChildKey)) return sum;

        int result = 0;
        if (map.containsKey(leftChildKey)) result += dfs(map, leftChildKey, sum);
        if (map.containsKey(rightChildKey)) result += dfs(map, rightChildKey, sum);

        return result;
    }
private int sample_funcname ( Map < Integer , Integer > map , int key , int sum ) {
  sum += map . get ( key ) ;
  int level = key / 10 ;
  int position = key % 10 ;
  int leftChildKey = ( level + 1 ) * 10 + position * 2 - 1 ;
  int rightChildKey = leftChildKey + 1 ;
  if ( ! map . containsKey ( leftChildKey ) && ! map . containsKey ( rightChildKey ) ) return sum ;
  int result = 0 ;
  if ( map . containsKey ( leftChildKey ) ) result += dfs ( map , leftChildKey , sum ) ;
  if ( map . containsKey ( rightChildKey ) ) result += dfs ( map , rightChildKey , sum ) ;
  return result ;
}
