We consider weighted tree automata over strong bimonoids which are, roughly speaking, semirings without distributivity. We prove sufficient and necessary conditions under which the initial algebra semantics and the run semantics of these automata coincide. We prove closure properties of the class of recognizable tree series, a determinization result, and a characterization of recognizable step functions.