parentNode(parent), // we store the parent node as an int
startCharPosition(start), // the suffix tree class will hold the sequence that the startCharPosition and
endCharPosition(end) // endCharPosition indices correspond to
parentNode(parent), // we store the parent node as an int
startCharPosition(start), // the suffix tree class will hold the sequence that the startCharPosition and
endCharPosition(end) // endCharPosition indices correspond to