Non-separating trees in connected graphs

Let T be any tree of order d>=1. We prove that every connected graph G with minimum degree d contains a subtree T^' isomorphic to T such that G-V(T^') is connected.