Trees · Medium problem

A caterpillar-shaped tree has a spine of $k$ vertices in a row. Each internal spine vertex (every spine vertex except the two ends) carries exactly $2$ pendant leaves, and each of the two spine ends carries exactly $1$ pendant leaf. If the tree has $34$ leaves in total, how many vertices are on the spine?