剑指offer十九：二叉树的镜像

 

 

#include<iostream>
using namespace std;

typedef struct treenode
{
	int data;
	treenode* left;
	treenode* right;
}node,*pnode;

void mirrorRecursive(pnode head)
{
	if (head == NULL || (head->left==NULL&&head->right==NULL))
		return;
	pnode temp = head->left;
	head->left = head->right;
	head->right = temp;
	if (head->left)
		mirrorRecursive(head->left);
	if (head->right)
		mirrorRecursive(head->right);
}