A tree has a perfect matching exactly when each vertex deletion has one odd component

Prove that a tree \(T\) has a perfect matching if and only if, for every vertex \(v\) of \(T\), the number of odd components of \[ T-v \] is \(1\).