# which of the below is not a property of a binary search tree?
i. for any node x in binary search tree, every key in left subtree of x is <= x's key. every key in right subtree of x is >= x's key.
ii. if key is equal, then we can put that key in either left or right sub tree.
iii. inorder traversal of a binary search tree visits nodes in sorted order.