Given a binary tree of integer keys, write the function

void longestPath (node *root);

which receives the pointer root to the tree root, and it prints the longest sequence of keys with strictly increasing values encountered by visiting the tree from root to leaves. For example, given the following binary tree

the longest sequence of increasing keys include keys {3, 5, 10} or keys {11, 21, 29} at choice. Report the C node structure to store the tree nodes.