Class CBTInserter
java.lang.Object
g0901_1000.s0919_complete_binary_tree_inserter.CBTInserter
919 - Complete Binary Tree Inserter.<p>Medium</p>
<p>A <strong>complete binary tree</strong> is a binary tree in which every level, except possibly the last, is completely filled, and all nodes are as far left as possible.</p>
<p>Design an algorithm to insert a new node to a complete binary tree keeping it complete after the insertion.</p>
<p>Implement the <code>CBTInserter</code> class:</p>
<ul>
<li><code>CBTInserter(TreeNode root)</code> Initializes the data structure with the <code>root</code> of the complete binary tree.</li>
<li><code>int insert(int v)</code> Inserts a <code>TreeNode</code> into the tree with value <code>Node.val == val</code> so that the tree remains complete, and returns the value of the parent of the inserted <code>TreeNode</code>.</li>
<li><code>TreeNode get_root()</code> Returns the root node of the tree.</li>
</ul>
<p><strong>Example 1:</strong></p>
<p><img src="https://assets.leetcode.com/uploads/2021/08/03/lc-treeinsert.jpg" alt="" /></p>
<p><strong>Input</strong> [“CBTInserter”, “insert”, “insert”, “get_root”] [<a href="1,-2">1, 2</a>, [3], [4], []]</p>
<p><strong>Output:</strong> [null, 1, 2, [1, 2, 3, 4]]</p>
<p><strong>Explanation:</strong></p>
<pre><code> CBTInserter cBTInserter = new CBTInserter([1, 2]);
cBTInserter.insert(3); // return 1
cBTInserter.insert(4); // return 2
cBTInserter.get\_root(); // return [1, 2, 3, 4]
</code></pre>
<p><strong>Constraints:</strong></p>
<ul>
<li>The number of nodes in the tree will be in the range <code>[1, 1000]</code>.</li>
<li><code>0 <= Node.val <= 5000</code></li>
<li><code>root</code> is a complete binary tree.</li>
<li><code>0 <= val <= 5000</code></li>
<li>At most <code>10<sup>4</sup></code> calls will be made to <code>insert</code> and <code>get_root</code>.</li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
CBTInserter
-
-
Method Details
-
insert
public int insert(int val) -
getRoot
-