This question uses binary search trees in the development of a sorting algorithm. A binary search tree is a binary tree where each node contains a value x$,$ such that all values in the left subtree are less than x$,$ and those in the right subtree are greater than x$.$ We de$$ne binary trees using the following polymorphic data type: