2-3 Deletion (Case #1)

Learn the deletion operation in 2-3 trees. All four scenarios are based on the position of the element, which needs to be deleted.

Deletion algorithm

Deletion in 2-3 trees is implemented based on the same scenarios discussed in the last lesson but in the reverse order. The deletion algorithm also takes O(Logn)O(Logn) ...