Prentice.Hall.Introduction.to.Java.Programming,.Brief.Version.9th.(2014).[sharethefiles.com]

After deleting 25, the new tree is as shown in Figure 48.28(j). Now
delete 16. Apply Case 2, as shown in Figure 48.28(k). The new tree is
shown in Figure 48.28(l).
After deleting 34, the new tree is as shown in Figure 48.28(m).
After deleting 27, the new tree is as shown in Figure 48.28(n).
20
20
20
15
34
15
34
15
27
3 16 25
50
3 16 25
null
3 16 25 34
27
27
(a) Delete 50 (b) Case 1.2 (c) Delete 20
16
16
16
15
27
15
27
15
27
3 16 25 34
3 null 25 34
3 25 34
(d) Copy 16 to replace 20 (e) Case 2 (f) Delete 15
16
16
27
3
27
null
27
16
34
25 34
25 34
null
25
(g) Delete 3 (h) Case 3 (i) Case 2
27
27
27
16
34
16
34
null
34
25
(i) Delete 25 (j) Delete 16 (k) Case 2
27
27 root: null
34
(l) Delete 34 (m) Delete 27 (n) Empty tree
21