原题链接在这里:https://leetcode.com/problems/invert-binary-tree/
树的问题多为recursion. 从上到下一层一层交换左右。
Time O(n), Space O(logn).
Note: 原函数返回TreeNode, 可以来一个helper返回void来辅助recursion. 若是不想要返回值,单纯想改变原结构时可以用这种建一个返回void的函数。
AC Java:
/**
* 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) {
helper(root);
return root;
}
private void helper(TreeNode root){
if(root == null){
return;
}
TreeNode temp = root.left;
root.left = root.right;
root.right = temp;
helper(root.left);
helper(root.right);
}
}