Hello! I want to implement a avltree using C++,and I have do most of it,except the remove() algorithm. My question is when should I rotate the tree in remove(). I hope that any body can represent the situation for me using the Pelple's language,because the implemented code depend on the data structure which you had used.
here ,I give you some of my code for a reference. In this code,all the avltree class's method could be used,except the remove().
is used to debug,and you can run it independent.
is the hole class's head files.
By the way,there's another important question:
how to compile the template separately?
Would you use my code myt_avltree.h to give a example for me?
Help me to implement it,or give me some advances please.
Thank you very much!:) [INDENT]