翻转一棵二叉树
样例
1 1
/ \ / \
2 3 => 3 2
/ \
4 4
挑战
递归固然可行,能否写个非递归的?
解题思路1:
递归。先将左孩子为根的子树翻转,再将右孩子为根的子树翻转,最后将该节点的左右子树翻转即可。
/**
* 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) {
// write your code here
if(root == null)
return;
invertBinaryTree(root.left);
invertBinaryTree(root.right);
TreeNode temp = root.left;
root.left = root.right;
root.right = temp;
}
}
解题思路2:
非递归版本1,类似于DFS,自顶向下翻转。
/**
* 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) {
// write your code here
if(root == null)
return;
Stack<TreeNode> stack = new Stack<>();
stack.push(root);
while(!stack.isEmpty()){
TreeNode node = stack.pop();
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);
}
}
}
解题思路3:
类似于二叉树遍历的非递归版本,用栈来模拟系统栈。
/**
* 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) {
// write your code here
if(root == null)
return;
Stack<TreeNode> stack = new Stack<>();
while(root!=null || !stack.isEmpty()){
while(root != null){
stack.push(root);
root = root.left;
}
root = stack.pop();
TreeNode temp = root.left;
root.left = root.right;
root.right = temp;
root = root.left;//本应该遍历到右子树的,但由于左右子树翻转后,原来的右子树成了左子树。
}
}
}