N
Nobody
I've got a Binary Search Tree all completed, and now I am trying to derive
an AVL Tree from it. I've got all the functions figured out except the
removal. Haven't got a clue on an algorithm to do this. Obviously, I remove
the node and all of its sub nodes and then balance the tree. Or do I remove
the node & sub nodes "in order" balancing the tree as I go?
an AVL Tree from it. I've got all the functions figured out except the
removal. Haven't got a clue on an algorithm to do this. Obviously, I remove
the node and all of its sub nodes and then balance the tree. Or do I remove
the node & sub nodes "in order" balancing the tree as I go?