题目:操作给定的二叉树,将其变换为源二叉树的镜像。输入描述:二叉树的镜像定义:源二叉树: 8 / 6 10 / / 5 7 9 11镜像二叉树: 8 / 10 6 / / 11 9 7 5 实现 12345678910111213141516171819202122232425 public class TreeNode { int val = 0; TreeNode left = null; TreeNode right = null; public TreeNode(int val) { this.val = val; }}*/public class { public void Mirror(TreeNode root) { // 特殊输入的检查 if (root == null) return; TreeNode tmp = root.left; root.left = root.right; root.right = tmp; Mirror(root.left); Mirror(root.right); }} 赞微海报分享
近期评论