Which of the Following Statements About Balanced Trees Is NOT

Which of the following statements about balanced trees is NOT correct?

A) For a given height, a balanced tree can hold more nodes than an unbalanced tree.
B) In a balanced binary tree, each subtree has approximately the same number of nodes.
C) In a balanced tree, all paths from the root to the leaves have approximately the same length.
D) The efficiency of algorithms for balanced trees is better expressed using the size of the tree than the height of the tree.