LeetCode226--翻转二叉树
2019-01-24 21:41
288 查看
题目描述:
解题思路:将左子树和右子树作为一个整体,进行翻转,递归,在分别将左子树的左右子树进行翻转,同理将右子树的左右子树进行翻转。
注:击败100%用户
class Solution { public TreeNode invertTree(TreeNode root) { if(root == null){ return null; } else { TreeNode node = null; node = root.left; root.left = root.right; root.right = node; root.left = invertTree(root.left); root.right = invertTree(root.right); return root; } } }
相关文章推荐
- 翻转二叉树(leetcode-226)
- 【LeetCode】226. Invert Binary Tree 二叉树翻转
- LeetCode 226 Invert Binary Tree(翻转二叉树)
- leetcode - 226 - 翻转二叉树
- leetcode 226 Invert Binary Tree 翻转二叉树
- leetcode 226 Invert Binary Tree 翻转二叉树
- leetcode 226 Invert Binary Tree 翻转二叉树
- [LeetCode] 226 翻转二叉树
- leetcode 226. Invert Binary Tree 反转二叉树 + DFS深度优先搜索
- LeetCode 226 Invert Binary Tree(转换二叉树)
- Leetcode 226: Invert Binary Tree(二叉树反转 递归、非递归实现)
- 【LeetCode-面试算法经典-Java实现】【226-Invert Binary Tree(反转二叉树)】
- [LeetCode]226. Invert Binary Tree(反转二叉树)
- leetcode 226. Invert Binary Tree(C语言,二叉树,递归)54
- 226.leetcode Invert Binary Tree(easy)[二叉树 递归]
- [LeetCode] Invert Binary Tree - 二叉树翻转系列问题
- leetcode 226. Invert Binary Tree(倒置一个二叉树,递归,非递归)
- Leetcode 226 Invert Binary Tree 二叉树
- leetcode-226. Invert Binary Tree 二叉树、递归,交换两个变量的值
- 【LeetCode】Invert Binary Tree 翻转二叉树 - Easy++