leetcode-226.翻转二叉树

题目：https://leetcode-cn.com/problems/invert-binary-tree/

答案：递归

  TreeNode temp;

    public TreeNode invertTree(TreeNode root) {

   reverseTree(root);

         return root;

    }

    public void reverseTree(TreeNode node){

        if(node!=null){

            temp = node.left;

            node.left = node.right;

            node.right = temp;

            reverseTree(node.left);

            reverseTree(node.right);

        }

    }