描述
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.
Write a data structure CBTInserter
that is initialized with a complete binary tree and supports the following operations:
CBTInserter(TreeNode root)
initializes the data structure on a given tree with head noderoot
;CBTInserter.insert(int v)
will insert aTreeNode
into the tree with valuenode.val = v
so that the tree remains complete, and returns the value of the parent of the inserted TreeNode;CBTInserter.get_root()
will return the head node of the tree.
Example 1:
1 | Input: inputs = ["CBTInserter","insert","get_root"], inputs = [[[1]],[2],[]] |
Example 2:
1 | Input: inputs = ["CBTInserter","insert","insert","get_root"], inputs = [[[1,2,3,4,5,6]],[7],[8],[]] |
Note:
- The initial given tree is complete and contains between
1
and1000
nodes. CBTInserter.insert
is called at most10000
times per test case.Every value of a given or inserted node is between
0
and5000
.
分析
题目给定了一个二叉树,要求写一个二叉树操作类,这个类可以初始化一个二叉树,插入二叉树,获取二叉树的根节点。可以使用数组来存储,就跟堆使用数组来表示二叉树一样,如果父节点的索引是 i,左子树则为 $2i$,右子树为 $2i+1$,初始化的时间复杂度是 $O(n)$,插入,获取根节点的复杂度是 $O(1)$。
解决方案1(Java)
1 | /** |