This document provides instructions to (1) construct a binary search tree (BST) by inserting keys from 15 to 11 in 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.