QUESTION 4 The followings are the properties of a Binary Search Tree except: o the binary tree must be a complete binary tree o the parent of a node is always greater than the node itself. O every subtree may have zero, one or two child nodes. O the smallest value in a node is always on the left-most node at the leaf level