Which statement about In-Place Algorithm is correct?

A. it compares with a middle element at each step B. its subtrees do not become excessively skewed C. it avoids allocating an auxiliary structure proportional to input size D. it bounds a function from below for sufficiently large inputs