Does anyone know if Mark's binary tree thing attempts to balance the tree when a new node is inserted to make searches faster?
http://www.csse.monash.edu.au/~lloyd/tildeAlgDS/Tree/
I haven't decided yet if I will use a list I sort, or a binary tree yet for keeping the sprites in the same order as they need to be drawn in. Since the binary tree stuff isn't in the docs, it might confuse people who come across it in the code. I know I wouldn't know where to start looking to find the information on them.
http://www.csse.monash.edu.au/~lloyd/tildeAlgDS/Tree/
I haven't decided yet if I will use a list I sort, or a binary tree yet for keeping the sprites in the same order as they need to be drawn in. Since the binary tree stuff isn't in the docs, it might confuse people who come across it in the code. I know I wouldn't know where to start looking to find the information on them.