156. Binary Tree Upside Down

最新推荐文章于 2019-09-17 17:14:20 发布

niunc

最新推荐文章于 2019-09-17 17:14:20 发布

阅读量112

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/niunc/article/details/82354560

版权

LeetCode 专栏收录该内容

185 篇文章 0 订阅

订阅专栏

https://leetcode.com/problems/binary-tree-upside-down/description/

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.

Example:

Input: [1,2,3,4,5]

    1
   / \
  2   3
 / \
4   5

Output: return the root of the binary tree [4,5,2,#,#,3,1]

   4
  / \
 5   2
    / \
   3   1

Clarification:

Confused what [4,5,2,#,#,3,1] means? Read more below on how binary tree is serialized on OJ.

The serialization of a binary tree follows a level order traversal, where '#' signifies a path terminator where no node exists below.

Here's an example:

The above binary tree is serialized as [1,2,3,#,#,4,#,#,5].

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution(object):
    def upsideDownBinaryTree(self, root):
        """
        :type root: TreeNode
        :rtype: TreeNode
        """
        if not root:
            return
        elif not root.right and not root.left:
            return root
        res = self.upsideDownBinaryTree(root.left)
        root.left.left = root.right
        root.left.right = root
        root.left = None
        root.right = None
        return res