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

A) In a Binary Search Tree, the left child of a node contains values greater than the node, and the right child contains values smaller than the node.
B) The height of a perfectly balanced Binary Search Tree with "n" nodes is O(log n), ensuring optimal search, insertion, and deletion operations.
C) A Binary Search Tree always maintains balanced heights in both subtrees, ensuring that the tree has O(log n) time complexity for all operations.
D) In-order traversal of a Binary Search Tree visits nodes in decreasing order, ensuring the largest element is visited first.