Invert Binary Tree

来源:互联网 发布:2017淘宝销量排行榜 编辑:程序博客网 时间:2024/06/05 22:39

Invert a binary tree.

     4   /   \  2     7 / \   / \1   3 6   9
to
     4   /   \  7     2 / \   / \9   6 3   1
/** * 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 null;        }        TreeNode left = root.left;        TreeNode right = root.right;        root.left = invertTree(right);        root.right = invertTree(left);        return root;    }}



0 0