题目描述
样例描述
思路
二叉树的堆式存储 + 完全二叉树性质 + 层序遍历
- 用数组来存储完全二叉树,从0开始编号的
- 奇偶数规律。插入一个结点后,如果结点总数是奇数,则一定插在右结点。反之偶数,则一定插在左结点(画图不难发现)
代码
/**
* 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 {
List<TreeNode> list;
public CBTInserter(TreeNode root)