Java: How does lazy deletion work with a Binary Search tree. So
if I want to lazily delete a node, do I create another reference to
that node, then set the node element to null? Does that trigger
rotations as well?
The specific data structure I'm working with is a Binary Search
Tree with the additional balancing property.