A full binary tree with n leaves contains

A

$$ n$$ nodes 

B

$$ \log_2 n$$ nodes 

C

$$ 2n - 1 $$

D

$$ 2^n$$ nodes