Lets use a TPA! 
SCAR Code:
Function TreeDown: Boolean;
var
colors1 : TPointArray;
colors2 : TIntegerArray;
begin
if Not LoggedIn then Exit;
Wait(RandomRange(50, 650));
FindColorsSpiralTolerance(x, y, colors1, treecolor, MSx1, MSy1, MSx2, MSy2, 5); // <- these are probably wrong parameters you know what i mean though
for i := 0 to High(Colors1) do
Colors2[i] := GetColor(Colors1[i].x, Colors1[i].y);
ClearSameIntegersAndTPA(Colors2, Colors1);
repeat
Wait(100+random(25));
for i := 0 to High(Colors1) do
if not(Colors2[i] := GetColor(Colors1[i].x, Colors1[i].y)) then
begin
result := true;
break;
end;
until result;
if Result then WriteLn('Tree down.');
end;
*Edit, improved code! 
Rather advanced function, but you should be able to get that to work. I don't think it does currently, but its close
.
Good luck, hope I helped! 
Nava2