The document outlines the steps for constructing a binary search tree (BST) by inserting a specific set of keys in order. It includes tasks for deleting the node with the value 15 using two different methods: copying and merging. The total points for the tasks are 20, with different points allocated to each part.

1. (10 points) Construct a BST by inserting the following keys into an empty BST, in order.
15, 17, 10, 2, 19, 18, 14, 8, 7, 16, 3, 4, 11.
(5 points) Delete the node with value 15 from the resulting BST tree in part a. by copying.
(5 points) Delete the node with value 15 from the resulting BST tree in part a. by merging.