Mirror Tree

Problem

https://practice.geeksforgeeks.org/problems/mirror-tree/1

Solution

Recursive

Method: Recursive
Language: C++
Time complexity: O(Number of nodes)
Space complexity: 0(Height of tree)

// Function fingerprint
void mirror(Node* node) 
{
     // Your Code Here
     if(node == NULL) return;
     mirror(node->right);
     mirror(node->left);
     Node * t = node->right;
     node->right = node->left;
     node->left = t;
     return;
}