Question: Which of the following statements about Binary Search Trees (BST) is correct?

A) The time complexity of searching for an element in a balanced Binary Search Tree is O(n).
B) In a Binary Search Tree, the left subtree of a node contains only nodes with values greater than the node's value.
C) A Binary Search Tree can have duplicate elements, as long as the duplicates are stored in the right subtree.
D) In a balanced Binary Search Tree, both the left and right subtrees of any node differ in height by at most one, ensuring logarithmic search time.