The second largest eigenvalue (λ2) provides significant information on characteristics and structure of graphs. Therefore, finding bounds for λ2 is a topic of interest in many fields. In this paper we prove one general theorem about values of λ2 of graphs with a cut-vertex and after that we determine all trees with the property λ2 ≤ 1+ √ 5 2.