consider a grammar
S->aA
A->aA |a.
consider a string =aaa.
parse tree is
Here terminals of a string are leaf nodes and
production rules are internal nodes.
no of nodes in a tree is =internal+leaf nodes.
internal=m & leaf=n.
total no of nodes in a tree=m+n