An equation of the form $$T(n)-(\alpha+\beta)T(n-1)+\alpha\beta T(n-2)=0 \text { with }\alpha \neq \beta$$ has a general solution of the form $$T(n)=A\alpha^n+B\beta^n$$
$A$ and $B$ can be determined from two values of $T(n)$ eg $T(0)$ and $T(1)$ - this makes sense because two values completely determine the solution of the recurrence simply by successive applications of the recurrence equation.
When $\alpha = \beta$ there are still two degrees of freedom in the solution, but now the form is $$T(n)=(An+B)\alpha^n$$
This last case is best seen using the generating function $$g(t)=\sum_{n=0}^\infty T(n)t^n$$ from which we obtain $$(1-2\alpha t+\alpha^2t^2)g(t)=T(0)+(T(1)-2\alpha T(0))t=P+Qt$$
We then have - using partial fraction decomposition $$g(t)=\frac{P+Qt}{(1-\alpha t)^2} = \frac {R}{1-\alpha t}+\frac {S}{(1-\alpha t)^2}$$
If we expand these expressions using the binomial theorem, we can obtain $T(n)$ in the form I suggested. Once the form is known, it can be applied directly to the problem. Similar calculations prove the forms for triple and higher roots in linear recurrences with more terms. (If the roots are distinct, the partial fractions are all of the form $\frac A {1-\alpha t}$ for the various roots.)