Which statement about Red-Black Tree is correct?

A. insertion occurs at the rear and removal at the front B. nodes on the last level are as far left as possible C. its rules guarantee logarithmic height without strict AVL-style balance D. the rear index can wrap to the beginning of the array