My Question: (From Chapter 11 of Programming Languages Principles and Practices, 3rd ed Louden, Lambert)

Write an algebraic specification for an abstract data type bstree (binary search tree) with the following operations:

Create:bstree

Make:bstree x element 3 bstree ->bstree

Empty:bstree -> Boolean

Left: bstree -> bstree

Right : bstree -> bstree

Data : bstree -> element

Isin: bstree x element -> Boolean

Insert : bstree x element -> bstree

What does one need to know about the element data type in order for a bstree data type to be possible.