Leetcode Bianry tree upside down

proudmore

于 2015-03-07 06:24:17 发布

阅读量129

点赞数

分类专栏： leetcode leetcode tree

本文链接：https://blog.csdn.net/proudmore/article/details/44113005

版权

leetcode 同时被 2 个专栏收录

146 篇文章 0 订阅

订阅专栏

leetcode tree

15 篇文章 0 订阅

订阅专栏

Given a binary tree where all the right nodes are either leaf nodes with a sibling (a left
node that shares the same parent node) or empty, flip it upside down and turn it into a tree
where the original right nodes turned into left leaf nodes. Return the new root.

[code]

public TreeNode UpsideDownBinaryTree(TreeNode root) {
    TreeNode p = root, parent = null, parentRight = null;
    while (p != null) {
        TreeNode left = p.left;
        p.left = parentRight;
        parentRight = p.right;
        p.right = parent;
        parent = p;
        p = left;
    }
    return parent;
}