The specialty of the inorder traversal of a binary search tree is that it traverses the tree in ascending order. This is because a binary search tree consists of elements lesser than the node to the left and the ones greater than the node to the right. Therefore, when we traverse the tree in an inorder fashion, we first visit the left subtree, then the root node, and finally the right subtree. This results in the elements being visited in ascending order.