private void InitializeChildren()
{
children = new CandidateNode[firstNumber];
for (int i = 0; i < firstNumber; i++)
{
children[i] = new CandidateNode(pageSize, firstNumber, transactionLength, depth + 1);
}
}
internal CandidateHashTree(int transactionLength, int pageSize, int firstNumber)
{
root = new CandidateNode(pageSize, firstNumber, transactionLength, 0);
}