LeetCode 998. Maximum Binary Tree II解题报告(python)

998. Maximum Binary Tree II

998. Maximum Binary Tree II python solution

题目描述

We are given the root node of a maximum tree: a tree where every node has a value greater than any other value in its subtree.
Just as in the previous problem, the given tree was constructed from an list A (root = Construct(A)) recursively with the following Construct(A) routine:
If A is empty, return null.
Otherwise, let A[i] be the largest element of A. Create a root node with value A[i].
The left child of root will be Construct([A[0], A[1], …, A[i-1]])
The right child of root will be Construct([A[i+1], A[i+2], …, A[A.length - 1]])
Return root.
Note that we were not given A directly, only a root node root = Construct(A).
Suppose B is a copy of A with the value val appended to it. It is guaranteed that B has unique values.
Return Construct(B).

解析

注意，新插入的节点是在A的尾部，所以插入节点的值若小于root节点，就将其放入root节点的右子树中。
采用递归的思想解题。如果新插入节点的值大于原节点，原本的root节点变成插入节点的左子树。如果插入节点的值小于原节点，将其和root节点的右子树进行递归更新。

class Solution:
    def insertIntoMaxTree(self, root: TreeNode, val: int) -> TreeNode:
        if root and root.val > val:
            root.right = self.insertIntoMaxTree(root.right, val)
            return root
        node = TreeNode(val)
        node.left = root
        return node

Reference

https://leetcode.com/problems/maximum-binary-tree-ii/discuss/242936/JavaC%2B%2BPython-Recursion-and-Iteration