226. Invert Binary Tree

2018-07-30  本文已影响0人  becauseyou_90cd

https://leetcode.com/problems/invert-binary-tree/description/
解题思路:用preoder traversal解决

代码:
class Solution {
public TreeNode invertTree(TreeNode root) {
if(root == null) return null;

    TreeNode temp = root.left;
    root.left = invertTree(root.right);
    root.right = invertTree(temp);
    return root;
}

}

上一篇 下一篇

猜你喜欢

热点阅读