GATE CS technical MSQ 13: Select all correct statements about a binary search tree with distinct keys.

A. An inorder traversal lists keys in sorted order. B. Search time is always O(log n), regardless of shape. C. Its height can be n−1. D. Every node must have exactly two children.