How the Experts Score is calculatedEach factor is scored 0–100 on absolute terms (standing in the category can only raise it), then weighted; problems flagged in review highlights or a recent slide in ratings are subtracted:Satisfaction 59%96+56.3Reliability 26%94+24.5Value 15%100+15.2Craft & service penalty99−0.1Experts Score= 96Not enough data for replies to reviews; its weight is shared by the others.Grade A: A = 80+, B = 60–79, C = 40–59, D = 20–39. Needs 10+ reviews.96SCOREGillis Lawn & Tree Care
Faribault, MN · Grade ALetter from the Experts Score: A = 80+, B = 60–79, C = 40–59, D = 20–39, F = under 20. · #22Position by Experts Score among all companies we track in this category. of 55 tree removal services · 4.9★ from 79 Google reviews
Report card
Percentile vs other tree removal services (100 = best)Each factor is scored 0–100 on absolute terms (star average, share of 1–2★ reviews, price verdicts…); standing within the category can only raise it, never lower it.. Strongest: value and momentum; weakest: reliability.
Reviews for your job
Customers hired Gillis Lawn & Tree Care for 6 kinds of job.
Gillis Lawn & Tree Care for yard work
Clear ✕All 3 Google reviews tagged “Yard work”
Gillis tree service did a great job cleaning up a large area of downed trees and branches.
We highly recommend Gillis Lawn & Tree Care as we had a number of dead trees in our yard and they removed them without damaging anything in our yard or our fence. They also did an exceptional job cleaning up all the trees, twigs and even raked anything else left behind. Very professional and it was all done in one day!!!
Rating only, no written review.
Price
Not enough reviews with a price yet.
Price verdictsGoogle asks reviewers whether the price was great, reasonable or overpriced; these are their answers.
Jobs customers hired them for
| Job | Reviews | Category typical |
|---|---|---|
| Tree removal | 13 | — |
| Tree trimming & pruning | 10 | — |
| Tree stump removal | 6 | — |
| Tree stump grinding | 4 | — |
| Mulching | 3 | — |
| Yard work | 3 | — |