本文共 827 字，大约阅读时间需要 2 分钟。

翻转二叉树

1         1 / \       / \2   3  => 3   2   /       \  4         4

/** * Definition of TreeNode: * public class TreeNode { *     public int val; *     public TreeNode left, right; *     public TreeNode(int val) { *         this.val = val; *         this.left = this.right = null; *     } * } */public class Solution {    /**     * @param root: a TreeNode, the root of the binary tree     * @return: nothing     */       public void invertBinaryTree(TreeNode root) {        if(root.left!=null||root.right!=null){        	 TreeNode empy=root.left;        	 root.left=root.right;        	 root.right=empy;        	 if(root.right!=null){        		 invertBinaryTree(root.right);             }        	 if(root.left!=null){        		 invertBinaryTree(root.left);             }        	        }         }}

转载地址：http://ivwxi.baihongyu.com/