Search
⌘K
Get Premium
Leetcode 998. Maximum Binary Tree II
Given a maximum binary tree and a value val appended to the original array, produce the new maximum tree that would result from appending val — this is done by placing val along the tree's right spine so the max-tree property (each node > values in its subtree) is preserved.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.