#include <stdio.h>
#include <stdlib.h>
 
// Structure for BST Node
struct Node {
    int data;
    struct Node *left, *right;
};
 
// Function to create a new node
struct Node* createNode(int value) {
    struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));
    newNode->data = value;
    newNode->left = newNode->right = NULL;
    return newNode;
}
 
// Function to insert node in BST
struct Node* insert(struct Node* root, int value) {
    if (root == NULL)
        return createNode(value);
 
    if (value < root->data)
        root->left = insert(root->left, value);
    else if (value > root->data)
        root->right = insert(root->right, value);
 
    return root;
}
 
// Inorder traversal
void inorder(struct Node* root) {
    if (root != NULL) {
        inorder(root->left);
        printf("%d ", root->data);
        inorder(root->right);
    }
}
 
// Function to create mirror image of the tree
void mirror(struct Node* root) {
    if (root == NULL)
        return;
 
    // Recursively mirror left and right subtrees
    mirror(root->left);
    mirror(root->right);
 
    // Swap left and right pointers
    struct Node* temp = root->left;
    root->left = root->right;
    root->right = temp;
}
 
int main() {
    struct Node* root = NULL;
 
    // Construct BST
    root = insert(root, 50);
    root = insert(root, 30);
    root = insert(root, 70);
    root = insert(root, 20);
    root = insert(root, 40);
    root = insert(root, 60);
    root = insert(root, 80);
 
    printf("Inorder Traversal of Original BST: ");
    inorder(root);
    printf("\n");
 
    // Create mirror image
    mirror(root);
 
    printf("Inorder Traversal of Mirror Image BST: ");
    inorder(root);
    printf("\n");
 
    return 0;
}