Practical C Programming

How to do it... – inorder traversal of the tree

Because it's a recursive form, the function will be called recursively. The function is as follows:

inorder(node)

Here, inorder is the function that will be recursively called and node is the node of the binary tree that's being passed to it. Initially, the node will be the root of the binary tree, whose inorder traversal is required. Follow these steps:

1. If node is NULL, go to step 2; otherwise, return to the caller function.

2. Call the same function (the inorder function) with the node's left child set as an argument:

call inorder(node->leftchild)

3. Display the content in the node:

display node->info

4. Call the same function itself (the inorder function) with the node's right child set as ...