Creating a exact mirror image of binary tree
public void reverseTree(BinaryTree node) {
if (node != null) {
//recursively call left and right elements
reverseTree(node.left);
reverseTree(node.right);
//swap the elements
BinaryTree temp = node.right;
node.right = node.left;
node.left = temp;
}
}
Time complexity: O(n)
Space complexity: O(n)
public void reverseTree(BinaryTree node) {
if (node != null) {
//recursively call left and right elements
reverseTree(node.left);
reverseTree(node.right);
//swap the elements
BinaryTree temp = node.right;
node.right = node.left;
node.left = temp;
}
}
Time complexity: O(n)
Space complexity: O(n)