Are there any concrete examples where 2-4 trees or Red Black trees turn out to be much better than AVL or general binary search trees in application?
How can you find successors and predecessors in a binary search tree in order?