Calculating the path length of a fractal tree

Question

Hi guys, I have this program that creates fractal trees that I made. I am trying to have it add up the path lengths and display them in a text area but it is not working. Here is the code that is relevant and any help would be greatly appreciated.
public void drawTree( Graphics g, int x, int y, double a, double lLength, double rLength, int itera, double path)  {
         if (itera<0) {
           path = path -lLength;
           pathLength.append(path+" ");
           return;
               int x0 = x + (int)(lLength*Math.cos(a));
               int y0 = y - (int)(lLength*Math.sin(a));
               g.drawLine(x, y, x0, y0);
               lLength = lLength*lRat;
               rLength = rLength*rRat;
               path = path + lLength;
               double a0 = a+Math.PI/rAng;
               double a1 = a-Math.PI/lAng;
               itera--;
               drawTree(g, x0, y0, a0, lLength, rLength, itera, path);
               drawTree(g, x0, y0, a1, rLength, rLength, itera, path);
             }

Answer 1

How would I do the returning of the path length?
It doesn't work because first, it gives you twice as many lengths as there are paths and second, they're not right.