Explanation:

A binary search tree (BST) is a binary tree data structure that satisfies the binary search property. The binary search property states that for any node in the tree, the value of the node's left child is less than the value of the node, and the value of the node's right child is greater than the value of the node.

Insertion:
Insertion is a common operation performed on a binary search tree. When inserting a new value into a BST, the tree is traversed starting from the root node, comparing the new value with the values of each node. Based on the comparison, the new value is placed as the left child or the right child of a node until a suitable position is found. Insertion ensures that the binary search property is maintained.

Deletion:
Deletion is also a common operation performed on a binary search tree. When deleting a node from a BST, there are three cases to consider:
1. The node has no children: In this case, the node is simply removed from the tree.
2. The node has one child: In this case, the child node replaces the deleted node in the tree.
3. The node has two children: In this case, the node is replaced by its in-order successor or in-order predecessor in the tree, and the successor/predecessor is deleted.

Search:
Searching for a value in a binary search tree is another common operation. The tree is traversed starting from the root node, comparing the search value with the values of each node. If the search value is found, the search is successful. Otherwise, the search continues by moving to the left or right child of the current node based on the comparison. This process continues until the value is found or until a leaf node is reached, indicating that the value is not present in the tree.

Sorting:
Sorting is not typically performed directly on a binary search tree. While a binary search tree inherently stores its elements in a sorted order, the main purpose of a binary search tree is to efficiently search for and retrieve values. If the goal is to obtain a sorted list of elements, it is more common to perform an in-order traversal of the binary search tree and collect the elements in sorted order.

Therefore, the operation that is not typically performed on a binary search tree is Sorting (option 'D').