A binary search tree has the property that for every node in the tree

a$.$

the depth of a node in a tree is the length of the path from the root to the node

b$.$

the value contained in a node can only be a primitive data type

c$.$

the value of any node in its right subtree is greater than the value of the node

d$.$

the value of any node in its left subtree is less than the value of the node

e$.$

can be represented using a set of linked nodes