To maximize a path through node , pick the two best downward paths from different children. If has children with max downward paths , the best path through is where and are the two largest.
You cannot use the same child twice. A path visits each node at most once. This constraint forces you to pick two different child subtrees. In a binary tree, you have at most two children, making the choice simple.