A "proper" binary search tree should have all of the following properties EXCEPT:

Each position $$ stores a key$-$value entry $($k$,$ v$)$

Keys stored in the left subtree of inline style $$ are less than k

Keys stored in the right subtree of inline style $$ are greater than k

All of the above are required for a proper binary search tree.