Recursive Get Tree Size

I need a small recursive method able to return a given multigrade tree size (the number of items contained in it), every node has several children. This other method returns the tree height, I place it as an example so you can figure out the structure of the tree.
public int getHeight(int height, Element element, int maxHeight){
      if(height > maxHeight)
        maxHeight = height;
      int i=0;
      for(i = 0; i < element.getNumChildren(); i++)
        return getHeight(height+1,element.getChild(i),maxHeight);
    return maxHeight;
    }

Open in new window

axturAsked:
Who is Participating?
I wear a lot of hats...

"The solutions and answers provided on Experts Exchange have been extremely helpful to me over the last few years. I wear a lot of hats - Developer, Database Administrator, Help Desk, etc., so I know a lot of things but not a lot about one thing. Experts Exchange gives me answers from people who do know a lot about one thing, in a easy to use platform." -Todd S.

lbertaccoCommented:
This counts all nodes (not only leaves):

public int getSize(Element element) {
  int i, size=1;
  for(i = 0; i < element.getNumChildren(); i++)
        size+=getSize(element.getChild(i));
  return size;
}
0

Experts Exchange Solution brought to you by

Your issues matter to us.

Facing a tech roadblock? Get the help and guidance you need from experienced professionals who care. Ask your question anytime, anywhere, with no hassle.

Start your 7-day free trial
axturAuthor Commented:
perfect solution
0
It's more than this solution.Get answers and train to solve all your tech problems - anytime, anywhere.Try it for free Edge Out The Competitionfor your dream job with proven skills and certifications.Get started today Stand Outas the employee with proven skills.Start learning today for free Move Your Career Forwardwith certification training in the latest technologies.Start your trial today
Java

From novice to tech pro — start learning today.