Thread: Tree java

Hey Andrei,

Could you please read This?

After reading, could you also clarify your question? Tell us what you're trying to accomplish, and what problem you are encountering.

public class Tree
	{
	    public static void main(String[] args)
	    {
 
	    int H = Integer.parseInt(args[0]);
	    int n = Integer.parseInt(args[1]);
	    int h = Integer.parseInt(args[2]);
 
	    String a = "A";
 
	    while (n > 0)
	        {
	        while (H > 0)
	            {
	            System.out.println(a);
	            a = "A" + a + "A";
	            H -= 1;
	            }
 
	        H = Integer.parseInt(args[0]);
	        a = a.substring(1, a.length() - 1);
	        n -= 1;
	        }
           }
	}

In java i need to type : java Tree 4 3 2 (this are the arguments)

So the result is this:

A
AAA
AAAAA
AAAAAAA
AAAAA
AAAAAAA
AAAAAAAAA
AAAAAAAAAAA
AAAAAAAAA
AAAAAAAAAAA
AAAAAAAAAAAAA
AAAAAAAAAAAAAAA

But I want that my final result would give me a straight tree, not like the one above (too on the left size). Like this:

         	   A
	         AAA
	        AAAAA
	      AAAAAAA
	        AAAAA
	      AAAAAAA
	    AAAAAAAAA
	   AAAAAAAAAAA
	     AAAAAAAA
	   AAAAAAAAAAA
	  AAAAAAAAAAAAA
	AAAAAAAAAAAAAAA

I suppose by a "straight tree", you want your lines to be aligned in the center.. What have you tried?

Do you notice any pattern occurring in the program? What is the correlation between the # of A's and the # of spaces that should be produced?

Depending on how far you want to space your tree, you are correct. There is an inverse relationship between the A's and spaces.

So in my eyes, if your greatest length of A's (which would be the bottom row) is 13, you would have 0 spaces. If you have a length of 11, you should have 2 spaces, length of 1 would have 12.

Now, how would you consider approaching this problem? There are an infinite number of ways to solve a problem.

I'm sorry, I don't quite understand your question. Could you clarify please?