If you use lazy deletion in a AVL tree, there is a very small time penalty because the depth of the tree increases by only a small constant when half the nodes in the tree were marked deleted.  What is the value of this constant and why is this?

Answer rating: 100% (QA)

The concept of AVL trees and lazy deletion which is often referred to as soft delete or lazy delete ... View the full answer