Make a three element array and use constants (or just simple variables that act as constants) and I imagine the performance of that algorithm will increase dramatically, as there isn't a second set of (unnecessary and potentially expensive) lookups performed while you descend the tree.

In the C example those names are nothing but sugar after the compiler is done with it - in your example, they are integral at every step in the execution.