  The general position number of a connected graph is the cardinality of a
largest set of vertices such that no three pairwise-distinct vertices from the
set lie on a common shortest path. In this paper it is proved that the general
position number is additive on the Cartesian product of two trees.
