if the following are true:

• val = a
• tree = node (a, (node (l, ll, lr)), (node (r, rl, rr)))
• smallest value in (node (r, rl, rr)) = near

then output of the bst_delete function where input tree is tree, value is val, visited is visited, and moves are moves = result of building the BST from nodes [ result of updating the root of (result of removing near from tree tree) with near, visited ] and moves moves