binarytreetraversal.cpp

#include <iostream> 
using namespace std; 
  
struct Node 
{ 
    int data; 
    struct Node* left, *right; 
    Node(int data) 
    { 
        this->data = data; 
        left = right = NULL; 
    } 
}; 
  
void printPostorder(struct Node* node) 
{ 
    if (node == NULL) 
        return; 
  
    printPostorder(node->left); 
  
    printPostorder(node->right); 
  
    cout << node->data << " "; 
} 
  
void printInorder(struct Node* node) 
{ 
    if (node == NULL) 
        return; 
  
    printInorder(node->left); 
  
    cout << node->data << " "; 
  
    printInorder(node->right); 
} 
  
void printPreorder(struct Node* node) 
{ 
    if (node == NULL) 
        return; 
  
    cout << node->data << " "; 
  
    printPreorder(node->left);  
  
    printPreorder(node->right); 
}  
  
int main() 
{ 
    struct Node *root = new Node(0); 
    root->left             = 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 << "\nPreorder traversal \n"; 
    printPreorder(root); 
  
    cout << "\nInorder traversal \n"; 
    printInorder(root);  
  
    cout << "\nPostorder traversal \n"; 
    printPostorder(root); 
  
}