Question

In C++ language.

void printTreeIO(Tnode *n)(3): recursive function that prints out the data in the tree in order

Answer 1

source code:

#include <iostream>
using namespace std;

/* A binary tree node has data, pointer to left child
and a pointer to right child */
struct Node
{
   int data;
   struct Node* left, *right;
   Node(int data)
   {
       this->data = data;
       left = right = NULL;
   }
};

/* Given a binary tree, print its nodes in inorder*/
void printInorder(struct Node* node)
{
   if (node == NULL)
       return;

   /* first recur on left child */
   printInorder(node->left);

   /* then print the data of node */
   cout << node->data << " ";

   /* now recur on right child */
   printInorder(node->right);
}

/* Driver program to test above functions*/
int main()
{
   struct Node *root = new Node(1);
   root->left           = new Node(2);
   root->right       = new Node(3);
   root->left->left   = new Node(4);
   root->left->right = new Node(5);

   cout << "\nInorder traversal of binary tree is \n";
   printInorder(root);

   return 0;
}