When deleting a node from a binary search tree $($BST$)$ with two children, what is typically done to maintain the BST property?

This would crash the program.

You replace the node with the minimum value for the right side tree.

The node is replaced by its left child or by the right child

Just remove the node by setting it to null.