Longest increasing downward path in a binary tree

In a binary tree, find the longest path that goes from a node down to one of its descendants where every child's value is greater than its parent's (not necessarily by exactly one). Return the path itself, not only its length.