
17 Mar
2004
17 Mar
'04
4:33 a.m.
This seems like a useful data structure, although I can't think of any specific use cases. I am assuming you are implementing it as a balanced binary tree where you keep track of the number of nodes in the subtree rooted at each node. (This allows finding a node by its numeric index in time.) -- Jeremy Maitin-Shepard