In a full binary tree, every internal node has exactly two children. A full binary tree with 2n+1 nodes containsa) n leaf nodeb) n internal nodesc) n-1 leaf nodesd) n-1 internal nodes