We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Java
  3. Advanced
  4. Java Visitor Pattern
  5. Discussions

Java Visitor Pattern

  • kailiu
     + 2 comments

    Hi, your solution is very neat. I like it. And do you have any second thought on handing one node tree. You didn't actually put anything into values[] and colors[] yet. 

    /* Handle 1-node tree */
        if (numNodes == 1) {
            return new TreeLeaf(values[0], colors[0], 0);
        }

    Maybe you mean 

    if (numNodes ==1) {
    		int single_value = scan.nextInt();
    		int single_color = scan.nextInt();
    		TreeLeaf leaf = new TreeLeaf(single_value, Color.values()[single_color],0);    		
    		return leaf;
    	}