Level order of a binary search tree: 80 30 90 10 85 5 20 89 12.

What is the level order after Hibbard deletion of 5, 10 and 80?

(Hibbard deletion of a Node with 2 children replaces that Node with its successor.