MerkleTree_getProofTreeByIndex.java

  public List<Bytes32> getProofTreeByIndex(int index) {
    if (dirty) calcBranches();
    List<Bytes32> proof = new ArrayList<Bytes32>();
    for (int i = 0; i < height; i++) {
      index = index % 2 == 1 ? index - 1 : index + 1;
      if (index < tree.get(i).size()) proof.add(tree.get(i).get(index));
      else proof.add(zeroHashes.get(i));
      index /= 2;
    }
    return proof;
  }