This document provides instructions to: 1) Construct a binary search tree (BST) by inserting keys 15, 17, 10, 2, 19, 18, 14, 8, 7, 16, 3, 4, 11 in that order into an empty tree; 2) Delete the node with value 15 from the resulting tree by copying; and 3) Delete the node with value 15 from the resulting tree by merging.