Which statement about Splay Tree is correct?

A. the minimum element is stored at the root B. each edge connects two vertices bidirectionally C. recently accessed elements become quicker to access again D. poor pivot choices can produce quadratic time