问题描述
解法
分析
Python 实现
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18
|
class : def invertTree(self, root): """ :type root: TreeNode :rtype: TreeNode """ if not root is None: root.left, root.right = root.right, root.left self.invertTree(root.left) self.invertTree(root.right) return root
|
Java 实现
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
|
* Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ class { public TreeNode invertTree(TreeNode root) { if(root != null){ TreeNode t = root.left; root.left = root.right; root.right = t; invertTree(root.left); invertTree(root.right);} return root; } }
|
时间复杂度
空间复杂度
链接
226. Invert Binary Tree
226. 翻转二叉树
(English version) Algorithm Notes: Leetcode#226 Invert Binary Tree
近期评论