In this paper, we study the bounds for discrete Steklov eigenvalues on trees via geometric quantities. For a finite tree, we prove sharp upper bounds for the first nonzero Steklov eigenvalue by the reciprocal of the size of the boundary and the diameter respectively. 

We also prove similar estimates for higher order Steklov eigenvalues.

海报