Inorder Traversal.cpp

#include<bits/stdc++.h>
#include<iostream>
using namespace std;

struct Node 
{ 
    int data; 
    struct Node* left, *right; 
    Node(int data) 
    { 
        this->data = data; 
        left = right = NULL; 
    } 
}; 

void printInorder(struct Node* node) 
{ 
    if (node == NULL) 
        return; 
  
    printInorder(node->left); 
    cout << node->data << " "; 
    printInorder(node->right); 
} 
  
int main() 
{ 
    struct Node *root = new Node(1); 
    root->left = new Node(2); 
    root->right->left = 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; 
}