Leetcode Invert Binary Tree
来源：互联网 发布：微商和淘宝哪个挣钱 编辑：程序博客网 时间：2024/06/08 00:05
Invert a binary tree.
4 / \ 2 7 / \ / \1 3 6 9to
4 / \ 7 2 / \ / \9 6 3 1
Difficulty: Easy
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { public TreeNode invertTree(TreeNode root) { if(root == null) return root; invertTree(root.left); invertTree(root.right); TreeNode temp = root.left; root.left = root.right; root.right = temp; return root; }} 0 0
- [leetcode] Invert Binary Tree
- [LeetCode]Invert Binary Tree
- leetcode：Invert Binary Tree
- LeetCode Invert Binary Tree
- LeetCode | Invert Binary Tree
- leetcode--Invert Binary Tree
- [leetcode] Invert Binary Tree
- [LeetCode] Invert Binary Tree
- LeetCode Invert Binary Tree
- leetcode : Invert Binary Tree
- [LeetCode] Invert Binary Tree
- [Leetcode]Invert Binary Tree
- LeetCode: Invert Binary Tree
- LeetCode Invert Binary Tree
- leetcode: Invert Binary Tree
- LeetCode Invert Binary Tree
- LeetCode || Invert Binary Tree
- LeetCode:Invert Binary Tree
- javaweb简单二维码
- Leetcode Odd Even Linked List
- Leetcode Reorder List
- Leetcode Palindrome Number
- 大笨鹰
- Leetcode Invert Binary Tree
- Leetcode Add Digits
- Leetcode Count and Say
- Leetcode Container With Most Water
- Leetcode Remove Element
- Leetcode Remove Duplicates from Sorted Array
- Leetcode Rotate Array
- Leetcode Merge Sorted Array
- Leetcode Find Minimum in Rotated Sorted Array
