Search
⌘K

Leetcode 919. Complete Binary Tree Inserter

Design a data structure that, given a complete binary tree, supports inserting a new node so the tree remains complete and retrieving the root. The insert operation should place the new node in the next available position (left-to-right on the last level) and return the value of its parent.


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Comments

Your account is free and you can post anonymously if you choose.