use node index access instead of pointers

I see that different tree search libraries uses in the struct ```Node``` not the child pointers but the ```Node``` index in a vector, to improve performance and be cache friendly.
Do you think that this can be possible? What do you expect about the performance result?