Write a set of rules that performs an inorder traversal of a

Write a set of rules that performs an in-order traversal of a binary tree. The binary tree is expressed by the set of nodes, similar to the tree used in the classroom example. Performing an in-order traversal of a binary search tree yields the node values of the tree in increasing order. A sample run will look like: Use the same database of nodes, but write a set of rules that print the node values represented by the search tree in descending order. A sample run can look like:

Solution

3.