Which statement about Full Binary Tree is correct?

A. it does not naturally support frequent updates B. edges typically represent characters or symbols C. no node has exactly one child D. it bounds a function from below for sufficiently large inputs