class CBTInserter {
TreeNode root;
int ans;
Map<TreeNode, Integer> nodeToChildCount;
public CBTInserter(TreeNode root) {
this.root = root;
ans = -1;
nodeToChildCount = new HashMap<>();
}
public int insert(int val) {
Deque<TreeNode> deque = new LinkedList<>();
deque.add(root);
while(!deque.isEmpty()) {
TreeNode node = deque.removeFirst();
if(node.left == null && node.right == null) {
node.left = new TreeNode(val);
return node.val;
} else if(node.right == null) {
node.right = new TreeNode(val);
return node.val;
}
deque.add(node.left);
deque.add(node.right);
}
return ans;
}
public TreeNode get_root() {
return root;
}
}
Leetcode_919_完全二叉树插入器_广搜
最新推荐文章于 2024-11-22 19:51:17 发布