def grow(self, times=<NUM_LIT:1>):
self.nodes.append([])<EOL>for n, node in enumerate(self.nodes[self.age]):<EOL><INDENT>if self.age == <NUM_LIT:0>:<EOL><INDENT>p_node = Node(self.pos[:<NUM_LIT:2>])<EOL><DEDENT>else:<EOL><INDENT>p_node = self._get_node_parent(self.age-<NUM_LIT:1>, n)<EOL><DEDENT>angle = node.get_node_angle(p_node)<EOL>for i in range(self.comp):<EOL><INDENT>tot_angle = self.__get_total_angle(angle, i)<EOL>length = self.__get_total_length(self.age+<NUM_LIT:1>, i)<EOL>self.nodes[self.age+<NUM_LIT:1>].append(node.make_new_node(length, tot_angle))<EOL><DEDENT><DEDENT>self.age += <NUM_LIT:1><EOL>if times > <NUM_LIT:1>:<EOL><INDENT>self.grow(times-<NUM_LIT:1>)<EOL><DEDENT>
Let the tree grow.

        Args:
            times (integer): Indicate how many times the tree will grow.