Question

919. 完全二叉树插入器

English Version

题目描述

完全二叉树 是每一层（除最后一层外）都是完全填充（即，节点数达到最大）的，并且所有的节点都尽可能地集中在左侧。

设计一种算法，将一个新节点插入到一个完整的二叉树中，并在插入后保持其完整。

实现 CBTInserter 类:

• CBTInserter(TreeNode root) 使用头节点为 root 的给定树初始化该数据结构；
• CBTInserter.insert(int v)  向树中插入一个值为 Node.val == val的新节点 TreeNode。使树保持完全二叉树的状态，并返回插入节点 TreeNode 的父节点的值；
• CBTInserter.get_root() 将返回树的头节点。

 

示例 1：

输入
["CBTInserter", "insert", "insert", "get_root"]
[[[1, 2]], [3], [4], []]
输出
[null, 1, 2, [1, 2, 3, 4]]

解释
CBTInserter cBTInserter = new CBTInserter([1, 2]);
cBTInserter.insert(3);  // 返回 1
cBTInserter.insert(4);  // 返回 2
cBTInserter.get_root(); // 返回 [1, 2, 3, 4]

 

提示：

• 树中节点数量范围为 [1, 1000] 
• 0 <= Node.val <= 5000
• root 是完全二叉树
• 0 <= val <= 5000 
• 每个测试用例最多调用 insert 和 get_root 操作 104 次

解法

方法一

# Definition for a binary tree node.
# class TreeNode:
#   def __init__(self, val=0, left=None, right=None):
#     self.val = val
#     self.left = left
#     self.right = right
class CBTInserter:
  def __init__(self, root: TreeNode):
    self.tree = []
    q = deque([root])
    while q:
      for _ in range(len(q)):
        node = q.popleft()
        self.tree.append(node)
        if node.left:
          q.append(node.left)
        if node.right:
          q.append(node.right)

  def insert(self, val: int) -> int:
    pid = (len(self.tree) - 1) >> 1
    node = TreeNode(val)
    self.tree.append(node)
    p = self.tree[pid]
    if p.left is None:
      p.left = node
    else:
      p.right = node
    return p.val

  def get_root(self) -> TreeNode:
    return self.tree[0]


# Your CBTInserter object will be instantiated and called as such:
# obj = CBTInserter(root)
# param_1 = obj.insert(val)
# param_2 = obj.get_root()

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *   int val;
 *   TreeNode left;
 *   TreeNode right;
 *   TreeNode() {}
 *   TreeNode(int val) { this.val = val; }
 *   TreeNode(int val, TreeNode left, TreeNode right) {
 *     this.val = val;
 *     this.left = left;
 *     this.right = right;
 *   }
 * }
 */
class CBTInserter {
  private List<TreeNode> tree;

  public CBTInserter(TreeNode root) {
    tree = new ArrayList<>();
    Deque<TreeNode> q = new ArrayDeque<>();
    q.offer(root);
    while (!q.isEmpty()) {
      TreeNode node = q.pollFirst();
      tree.add(node);
      if (node.left != null) {
        q.offer(node.left);
      }
      if (node.right != null) {
        q.offer(node.right);
      }
    }
  }

  public int insert(int val) {
    int pid = (tree.size() - 1) >> 1;
    TreeNode node = new TreeNode(val);
    tree.add(node);
    TreeNode p = tree.get(pid);
    if (p.left == null) {
      p.left = node;
    } else {
      p.right = node;
    }
    return p.val;
  }

  public TreeNode get_root() {
    return tree.get(0);
  }
}

/**
 * Your CBTInserter object will be instantiated and called as such:
 * CBTInserter obj = new CBTInserter(root);
 * int param_1 = obj.insert(val);
 * TreeNode param_2 = obj.get_root();
 */

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *   int val;
 *   TreeNode *left;
 *   TreeNode *right;
 *   TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *   TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *   TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class CBTInserter {
public:
  vector<TreeNode*> tree;

  CBTInserter(TreeNode* root) {
    queue<TreeNode*> q{{root}};
    while (!q.empty()) {
      auto node = q.front();
      q.pop();
      tree.push_back(node);
      if (node->left) q.push(node->left);
      if (node->right) q.push(node->right);
    }
  }

  int insert(int val) {
    int pid = tree.size() - 1 >> 1;
    TreeNode* node = new TreeNode(val);
    tree.push_back(node);
    TreeNode* p = tree[pid];
    if (!p->left)
      p->left = node;
    else
      p->right = node;
    return p->val;
  }

  TreeNode* get_root() {
    return tree[0];
  }
};

/**
 * Your CBTInserter object will be instantiated and called as such:
 * CBTInserter* obj = new CBTInserter(root);
 * int param_1 = obj->insert(val);
 * TreeNode* param_2 = obj->get_root();
 */

/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *   Val int
 *   Left *TreeNode
 *   Right *TreeNode
 * }
 */
type CBTInserter struct {
  tree []*TreeNode
}

func Constructor(root *TreeNode) CBTInserter {
  q := []*TreeNode{root}
  tree := []*TreeNode{}
  for len(q) > 0 {
    node := q[0]
    tree = append(tree, node)
    q = q[1:]
    if node.Left != nil {
      q = append(q, node.Left)
    }
    if node.Right != nil {
      q = append(q, node.Right)
    }
  }
  return CBTInserter{tree}
}

func (this *CBTInserter) Insert(val int) int {
  pid := (len(this.tree) - 1) >> 1
  node := &TreeNode{Val: val}
  this.tree = append(this.tree, node)
  p := this.tree[pid]
  if p.Left == nil {
    p.Left = node
  } else {
    p.Right = node
  }
  return p.Val
}

func (this *CBTInserter) Get_root() *TreeNode {
  return this.tree[0]
}

/**
 * Your CBTInserter object will be instantiated and called as such:
 * obj := Constructor(root);
 * param_1 := obj.Insert(val);
 * param_2 := obj.Get_root();
 */

/**
 * Definition for a binary tree node.
 * class TreeNode {
 *   val: number
 *   left: TreeNode | null
 *   right: TreeNode | null
 *   constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {
 *     this.val = (val===undefined ? 0 : val)
 *     this.left = (left===undefined ? null : left)
 *     this.right = (right===undefined ? null : right)
 *   }
 * }
 */

class CBTInserter {
  private root: TreeNode;
  private queue: TreeNode[];

  constructor(root: TreeNode | null) {
    this.root = root;
    this.queue = [this.root];
    while (true) {
      if (this.queue[0].left == null) {
        break;
      }
      this.queue.push(this.queue[0].left);
      if (this.queue[0].right == null) {
        break;
      }
      this.queue.push(this.queue[0].right);
      this.queue.shift();
    }
  }

  insert(val: number): number {
    if (this.queue[0].left != null && this.queue[0].right != null) {
      this.queue.shift();
    }
    const newNode = new TreeNode(val);
    this.queue.push(newNode);
    if (this.queue[0].left == null) {
      this.queue[0].left = newNode;
      return this.queue[0].val;
    }
    if (this.queue[0].right == null) {
      this.queue[0].right = newNode;
      return this.queue[0].val;
    }
    return 0;
  }

  get_root(): TreeNode | null {
    return this.root;
  }
}

/**
 * Your CBTInserter object will be instantiated and called as such:
 * var obj = new CBTInserter(root)
 * var param_1 = obj.insert(val)
 * var param_2 = obj.get_root()
 */

/**
 * Definition for a binary tree node.
 * function TreeNode(val, left, right) {
 *   this.val = (val===undefined ? 0 : val)
 *   this.left = (left===undefined ? null : left)
 *   this.right = (right===undefined ? null : right)
 * }
 */
/**
 * @param {TreeNode} root
 */
var CBTInserter = function (root) {
  this.tree = [];
  const q = [root];
  while (q.length) {
    const node = q.shift();
    this.tree.push(node);
    if (node.left) {
      q.push(node.left);
    }
    if (node.right) {
      q.push(node.right);
    }
  }
};

/**
 * @param {number} val
 * @return {number}
 */
CBTInserter.prototype.insert = function (val) {
  const pid = (this.tree.length - 1) >> 1;
  const node = new TreeNode(val);
  this.tree.push(node);
  const p = this.tree[pid];
  if (!p.left) {
    p.left = node;
  } else {
    p.right = node;
  }
  return p.val;
};

/**
 * @return {TreeNode}
 */
CBTInserter.prototype.get_root = function () {
  return this.tree[0];
};

/**
 * Your CBTInserter object will be instantiated and called as such:
 * var obj = new CBTInserter(root)
 * var param_1 = obj.insert(val)
 * var param_2 = obj.get_root()
 */