镜像二叉树

package com.company.offer;

public class ReverseTree {
    static class BinaryTreeNode{
        public BinaryTreeNode(int value){
            this.value = value;
        }
        int value;
        BinaryTreeNode left = null;
        BinaryTreeNode right = null;
    }

    public static void main(String[] args){
        BinaryTreeNode n1 = new BinaryTreeNode(1);
        BinaryTreeNode n2 = new BinaryTreeNode(2);
        BinaryTreeNode n3 = new BinaryTreeNode(3);
        BinaryTreeNode n4 = new BinaryTreeNode(4);
        BinaryTreeNode n5 = new BinaryTreeNode(5);
        BinaryTreeNode n6 = new BinaryTreeNode(6);
        BinaryTreeNode n7 = new BinaryTreeNode(7);
        BinaryTreeNode n8 = new BinaryTreeNode(8);
        BinaryTreeNode n9 = new BinaryTreeNode(9);
        BinaryTreeNode n10 = new BinaryTreeNode(1);
        BinaryTreeNode n11 = new BinaryTreeNode(2);
        BinaryTreeNode n12 = new BinaryTreeNode(102);
        n1.left = n2;
        n1.right = n3;
        n2.left = n4;
        n2.right = n5;
        n3.left = n6;
        n3.right =n7;
        n4.left = n8;
        n4.right = n9;
        n10.left = n11;

        BinaryTreeNode node = reverseBinaryTreeNode(n10);
        System.out.println("  "+node.right.value);
    }

    public static BinaryTreeNode reverseBinaryTreeNode(BinaryTreeNode node){
        if(node == null) return null;
        BinaryTreeNode resultNode = node;
        if(resultNode.left != null || resultNode.right != null){
            BinaryTreeNode tep  = resultNode.left;
            resultNode.left = resultNode.right;
            resultNode.right = tep;
        }
        if(resultNode.right != null) reverseBinaryTreeNode(resultNode.right);
        if(resultNode.left != null) reverseBinaryTreeNode(resultNode.left);
        return resultNode;
    }

}