The　k-uniform　s-hypertree　G　=　(V,E)　is　an　s-hypergraph,　where　1　≤　s　≤　k　-　1;　and　there　exists　a　host　tree　T　with　vertex　set　V　such　that　each　edge　of　G　induces　a　connected　subtree　of　T.　In　this　paper,　some　properties　of　uniform　s-hypertrees　are　establised,　as　well　as　the　upper　and　lower　bounds　on　the　largest　H-eigenvalue　of　the　adjacency　tensor　of　k-uniform　s-hypertrees　in　terms　of　the　maximal　degree　Δ.　Moreover,　we　also　show　that　the　gap　between　the　maximum　and　the　minimum　values　of　the　largest　H-eigenvalue　of　k-uniform　s-hypertrees　is　just　Θ(Δs/k).　©　2017,　Higher　Education　Press　and　Springer-Verlag　GmbH　Germany,　part　of　Springer　Nature.