Which statement about Radix Tree is correct?

A. both front and rear operations can be efficient B. it can suffer from primary clustering C. an edge may represent a string rather than one character D. suffixes are ordered lexicographically