資料結構與演算法

(5%) You are given the sequence of integers 15, 10, 20, 8, 12, 17, 25, 19 to insert into an initially empty binary search tree (BST). After constructing the BST:

I. Delete the node with value 20 and replace it with its in-order successor. II. Perform a post-order traversal of the updated BST.

What is the resulting post-order traversal of the BST after the deletion?