reverse order traversal of a binary search tree in C language. Write a C program that constructs a binary search tree from a list of input numbers, and then print out the binary search tree in a reverse order traversal of the tree.

Yes reverse order traversal. For example in the input file, if we enter the input sequence of 8,3,6,1,10,4,14,7,13.

Output should be 14,13,10,8,7,6,4,3,1

Means we should visit the right subtree first, then print node, and finally visit the left sub tree.