题目描述
输入描述:
二叉树的镜像定义:源二叉树 8 / \ 6 10 / \ / \ 5 7 9 11 镜像二叉树 8 / \ 10 6 / \ / \11 9 7 5
代码:
/** 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; } if(root.left==null&&root.right==null){ return; } TreeNode temp = null; temp = root.left; root.left=root.right; root.right=temp; if(root.left!=null){ Mirror(root.left); } if(root.right!=null){ Mirror(root.right); } } }
非递归:
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.empty()) { TreeNode node = stack.pop(); if(node.left != null || node.right != null) { TreeNode nodeLeft = node.left; TreeNode nodeRight = node.right; node.left = nodeRight; node.right = nodeLeft; } if(node.left != null) stack.push(node.left); if(node.right != null) stack.push(node.right); } } }