Problem 5. Binary Search Tree Q4. Select all the properties of a binary search tree. searches in O(1) on average used for searching searches in O(logn) on average each node has a value greater than the values of the nodes in its left subtree searches in O(n) on average each node has a value greater than values of its children.