code: def grow(self, times=1):
          
          self.nodes.append([])
  
          for n, node in enumerate(self.nodes[self.age]):
              if self.age == 0:
                  p_node = Node(self.pos[:2])
              else:
                  p_node = self._get_node_parent(self.age-1, n)
              angle = node.get_node_angle(p_node)
              for i in range(self.comp):
                  tot_angle = self.__get_total_angle(angle, i)
                  length = self.__get_total_length(self.age+1, i)
                  self.nodes[self.age+1].append(node.make_new_node(length, tot_angle))
  
          self.age += 1
  
          if times > 1:
              self.grow(times-1)
docs: Let the tree grow.
  
          Args:
              times (integer): Indicate how many times the tree will grow.