Non-deterministic finite tree automata operating bottom-up determinize completely via a generalized subset construction on tuples of child states. Conversely, deterministic top-down tree automata are strictly less expressive due to path independence.