You can put this solution on YOUR website! Suppose there was 1 edge to a "tree." Then the figure would have two vertices. By a simple induction argument (by adding one more segment) an n-edged figure would have n+1 vertices, so a 37-edged tree would have 38 vertices (assuming no three vertices form a triangle).