LeetCode 226. Invert Binary Tree 题解 —— Java
2017-03-16 12:33
477 查看
题目链接:https://leetcode.com/problems/invert-binary-tree/#/description
题目要求:反转二叉树——左子树换成右子树,右子树换成左子树
思路:首先将根节点的左右子树交换,然后递归的将左右子树再进行反转。
Java代码:
public class Solution {
public TreeNode invertTree(TreeNode root) {
if(root == null ){
return null;
}
TreeNode temp = root.left;
root.left = root.right;
root.right = temp;
invertTree(root.left);
invertTree(root.right);
return root;
}
}
题目要求:反转二叉树——左子树换成右子树,右子树换成左子树
思路:首先将根节点的左右子树交换,然后递归的将左右子树再进行反转。
Java代码:
public class Solution {
public TreeNode invertTree(TreeNode root) {
if(root == null ){
return null;
}
TreeNode temp = root.left;
root.left = root.right;
root.right = temp;
invertTree(root.left);
invertTree(root.right);
return root;
}
}
相关文章推荐
- [LeetCode-226]Invert Binary Tree(java)
- leetcode-226. Invert Binary Tree c++ java
- 【LeetCode-面试算法经典-Java实现】【226-Invert Binary Tree(反转二叉树)】
- Java [Leetcode 226]Invert Binary Tree
- LeetCode 226. Invert Binary Tree 题解(C++)
- LeetCode 226 -Invert Binary Tree ( JAVA )
- Java for LeetCode 226 Invert Binary Tree
- LeetCode题解-226-Invert Binary Tree
- Leetcode题解 226. Invert Binary Tree
- 【LeetCode】226 - Invert Binary Tree
- leetcode 226 Invert Binary Tree 翻转二叉树
- (easy)LeetCode 226.Invert Binary Tree
- LeetCode 226 Invert Binary Tree
- LeetCode Solution 05: 226Invert Binary Tree
- LeetCode#226 Invert Binary Tree
- LeetCode226——Invert Binary Tree
- LeetCode题解:Invert Binary Tree
- leetcode-226-Invert Binary Tree
- LeetCode题解:Invert Binary Tree
- Leetcode 226 Invert Binary Tree