DFS_traversal_of_tree.cpp

#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;
    }
};
 
/*Inorder traversal using Recursion*/
void printInorder(struct Node* node)
{
    if (node == NULL)
        return;
 
    printInorder(node->left);
    cout << node->data << " ";
    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;
}