Leetcode Problem 919. Complete Binary Tree Inserter

919. Complete Binary Tree Inserter

Leetcode Solutions

Perform a breadth-first search (BFS) on the given tree and add all nodes with 0 or 1 children to the deque.
For each insert operation, take the front node from the deque as the parent node.
Create a new node with the given value and add it as a left or right child of the parent node, depending on which one is available.
Add the new node to the back of the deque.
If the parent node now has two children, remove it from the deque.
Return the value of the parent node.
For the get_root operation, simply return the root of the tree.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen