919. Complete Binary Tree Inserter
Medium
30 Points
Tree
Breadth-First Search
Design
Binary Tree
A complete binary tree is a binary tree in which every level, except possibly the last, is completely filled, and all nodes are as far left as possible.
Design an algorithm to insert a new node to a complete binary tree keeping it complete after the insertion.
Implement the CBTInserter class:
Examples
Example 1
Input
["CBTInserter", "insert", "insert", "get_root"]
[[[1, 2]], [3], [4], []]
Output
[null, 1, 2, [1, 2, 3, 4]]
Explanation
CBTInserter cBTInserter = new CBTInserter([1, 2]);
cBTInserter.insert(3); // return 1
cBTInserter.insert(4); // return 2
cBTInserter.get_root(); // return [1, 2, 3, 4]
Constraints
The number of nodes in the tree will be in the range [1, 1000].0 <= Node.val <= 5000root is a complete binary tree.0 <= val <= 5000At most 104 calls will be made to insert and get_root.
919. Complete Binary Tree Inserter
Medium
30 Points
Tree
Breadth-First Search
Design
Binary Tree
A complete binary tree is a binary tree in which every level, except possibly the last, is completely filled, and all nodes are as far left as possible.
Design an algorithm to insert a new node to a complete binary tree keeping it complete after the insertion.
Implement the CBTInserter class:
Examples
Example 1
Input
["CBTInserter", "insert", "insert", "get_root"]
[[[1, 2]], [3], [4], []]
Output
[null, 1, 2, [1, 2, 3, 4]]
Explanation
CBTInserter cBTInserter = new CBTInserter([1, 2]);
cBTInserter.insert(3); // return 1
cBTInserter.insert(4); // return 2
cBTInserter.get_root(); // return [1, 2, 3, 4]
Constraints
The number of nodes in the tree will be in the range [1, 1000].0 <= Node.val <= 5000root is a complete binary tree.0 <= val <= 5000At most 104 calls will be made to insert and get_root.