Which statement about Undirected Graph is correct?

A. very deep recursion can cause stack overflow B. each node's balance factor is typically -1, 0, or 1 C. each edge connects two vertices bidirectionally D. the minimum element is stored at the root