We introduce linear weighted tree automata with storage and show that this model generalizes linear pushdown tree automata. We prove that the class of weighted tree languages recognizable by our linear automaton model is closed under inverse linear tree homomorphisms.