Edit: can someone provide clear answer with all details
$T(n)=T(n/10)+T(an)+n$ while $a$ is a const and $T(n)=1:(n<10)$
I was asked to find the minimum value for $a$ for which $T(n)=\omega(n)$
Using a set of complicated equations I found and proved that $a=9/10$ is the correct answer (for sure)
But how I can prove that using recursion tree?
Here I did all of the calculations: