Show solution plz

Consider the binary search tree below, whose nodes are labelled using English letters. The actual value inside each node doesn't matter in this question. B L On paper, trace through the steps to delete node A from this BST using the algorithm presented in our CSC263 lectures. As the answer to this question, enter the pre-order traversal of the resulting tree. Formatting notes: If the nodes visited are X.Y. Z in this order, enter "XYZ" with no additional whitespace or commas. Do NOT use lowercase letters. Consider the binary search tree below, whose nodes are labelled using English letters. The actual value inside each node doesn't matter in this question. On paper, trace through the steps to delete node A from this BST using the algorithm presented in our CSC263 lectures. As the answer to this question, enter the pre-order traversal of the resulting tree. Formatting notes: If the nodes visited are X, Y, Z in this order, enter "XYZ" with no additional whitespace or commas. Do NOT use lowercase letters