LeetCode链接:226. 翻转二叉树 - 力扣(LeetCode)
思路:如果root为null则返回空值,若不为空则交换左右子树
一、递归实现翻转二叉树(前序遍历)
java代码:
class Solution {
public TreeNode invertTree(TreeNode root) {
if(root == null) return null;
TreeNode tempNode = root.left;
root.left = root.right;
root.right = tempNode;
invertTree(root.left);
invertTree(root.right);
return root;
}
}
二、递归实现翻转二叉树(中序遍历)
class Solution {
public TreeNode invertTree(TreeNode root) {
if(root == null) return null;
invertTree(root.left);
TreeNode tempNode = root.left;
root.left = root.right;
root.right = tempNode;
invertTree(root.left);
return root;
}
}
三、递归实现翻转二叉树(后序遍历)
class Solution {
public TreeNode invertTree(TreeNode root) {
if(root == null) return null;
invertTree(root.left);
invertTree(root.right);
TreeNode tempNode = root.left;
root.left = root.right;
root.right = tempNode;
return root;
}
}
四、迭代实现翻转二叉树(层序遍历)
class Solution {
public TreeNode invertTree(TreeNode root) {
if(root == null) return null;
Queue queue = new LinkedList<>();
queue.offer(root);
TreeNode tempNode;
while(!queue.isEmpty()){
TreeNode node = queue.poll();
tempNode = node.left;
node.left = node.right;
node.right = tempNode;
if(node.left != null){
queue.offer(node.left);
}
if(node.right != null){
queue.offer(node.right);
}
}
return root;
}
}



