面试题19:二叉树镜像

题目：完成一个函数,输入一个二叉树,该函数输入它的镜像

思路：递归即可

public class MirrorRecursively {
	
	public static void mirrorRecursively(Node root){
		if(root==null)
			return;
		Node temp = root.getLeft();
		root.setLeft(root.getRight());
		root.setRight(temp);
		mirrorRecursively(root.getLeft());
		mirrorRecursively(root.getRight());
	}
}
class Node{
	private int data;
	private Node left;
	private Node right;
	public Node(int data) {
		super();
		this.data = data;
	}
	public int getData() {
		return data;
	}
	public void setData(int data) {
		this.data = data;
	}
	public Node getLeft() {
		return left;
	}
	public void setLeft(Node left) {
		this.left = left;
	}
	public Node getRight() {
		return right;
	}
	public void setRight(Node right) {
		this.right = right;
	}
	@Override
	public String toString() {
		return "Node [data=" + data + "]";
	}
	public Node() {
		super();
	}
}