Which of the following statement(s) is/are TRUE for any binary search tree (BST) having distinct integers?
- AThe maximum length of a path from the root node to any other node is .
- BAn inorder traversal will always produce a sorted sequence of elements.
- CFinding an element takes time in the worst case.
- DEvery BST is also a Min-Heap.

