title: How would you go about implementing a balanced tree with lazy deletions?
body: <p>More specifically, an AVL tree. Is it possible? I'd like to do it, but I'm thinking the undeleted nodes may be problematic to manage with the rotations.</p>
  
  <p>I have one that works normally, but I'd like to use this one with lazy deletion for something else.</p>