Using C language

Given a binary tree of integer keys, write the function

void longest Path (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 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. example, given the following binary tree.

 

6 6 (5) (10) 0 (21) (12) 7 (11) (29) 8