标签:
二叉树的镜像定义:源二叉树 8 / 6 10 / \ / 5 7 9 11 镜像二叉树 8 / 10 6 / \ / 11 9 7 5
<span style="font-size:18px;">/** public class TreeNode { int val = 0; TreeNode left = null; TreeNode right = null; public TreeNode(int val) { this.val = val; } } */ public class Solution { public void Mirror(TreeNode root) { if(root==null){ return ; } TreeNode temp; temp=root.left; root.left=root.right; root.right=temp; Mirror(root.left); Mirror(root.right); } }</span>代码2:
<span style="font-size:18px;">import java.util.*; public class Solution { public void Mirror(TreeNode root) { if(root==null){ return ; } Stack<TreeNode> stack=new Stack<TreeNode>(); stack.push(root); while(!stack.isEmpty()){ TreeNode node=stack.pop(); if(node.left!=null||node.right!=null){ TreeNode temp=node.left; node.left=node.right; node.right=temp; } if(node.left!=null){ stack.push(node.left); } if(node.right!=null){ stack.push(node.right); } } } }</span>
标签:
原文地址:http://blog.csdn.net/baidu_21578557/article/details/51494093