Invert Binary Tree

最新推荐文章于 2019-08-30 23:58:34 发布

HeyuHxm

最新推荐文章于 2019-08-30 23:58:34 发布

阅读量254

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/heyu123123123/article/details/71169681

版权

leetcode 专栏收录该内容

12 篇文章 0 订阅

订阅专栏

Invert Binary Tree

迭代版本:

`
    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;
            Queue<TreeNode> queue = new LinkedList<TreeNode>();

            queue.offer(root);
            while(!queue.isEmpty()) {
                TreeNode t = queue.poll();
                TreeNode right = t.right;
                t.right = t.left;
                t.left = right;
                if (t.left != null)
                    queue.offer(t.left);
                if (t.right != null) 
                    queue.offer(t.right);
            }
            return root;
        }
    }
`

递归版本:

`
    public class Solution {
        public TreeNode invertTree(TreeNode root) {
            if (root == null) 
                return null;
            TreeNode r  = root.right;
            root.right = invertTree(root.left);
            root.left = invertTree(r);
            return root;
        }
    }

`