Here is the pseudocode for an inorder traversal:

$[25$ pts$]$Suppose we apply this to a binary search tree for which all the keys are distinct. Prove by strong induction on n $>=0,$ the number of nodes in a tree, that if inorder$($ x$)$ is called where x is the root that the output is the keys in increasing order.