第八周

                              第八周

                            2017/10/29

---

Add One Row to Tree—https://leetcode.com/problems/add-one-row-to-tree/description/

---

题目描述：

Given the root of a binary tree, then value v and depth d, you need to add a row of nodes with value v at the given depth d. The root node is at depth 1.

The adding rule is: given a positive integer depth d, for each NOT null tree nodes N in depth d-1, create two tree nodes with value v as N's left subtree root and right subtree root. And N's original left subtree should be the left subtree of the new left subtree root, its original right subtree should be the right subtree of the new right subtree root. If depth d is 1 that means there is no depth d-1 at all, then create a tree node with value v as the new root of the whole original tree, and the original tree is the new root's left subtree.

题目的意思就是在给定的层数，将给定的值插入二叉树中，然后原来在左结点的子树就接到插入的左节点；原来在右结点的子树就接到插入的右结点。

自己的代码

TreeNode* addOneRow(TreeNode* root, int v, int d) {
        queue<TreeNode*> queue_;
        /*插入位置为根节点*/
        if (d == 1) {
            TreeNode* new_root = new TreeNode(v);
            new_root->left = root;
            return new_root;
        } else {
            /*记录访问到的树的高度*/
            int height = 1;
            TreeNode* temp = root;
            /*
            建立一个队列用来存储节点，每访问到一层，就存储这一层的
            所有节点，方法就是通过上一层的父节点来扩展，所以一开始
            就插入根节点到队列中，最后找到所要插入的层数时，就可以
            遍历队列，插入新建的节点。
            */
            queue_.push(root);

            while (height <= d - 1) {
                if (height == d - 1) {
                    while (!queue_.empty()) {
                        TreeNode* _temp = queue_.front();
                        TreeNode* Left_val = new TreeNode(v);
                        TreeNode* Right_val = new TreeNode(v);
                        TreeNode* Left_Node = _temp->left;
                        TreeNode* Right_Node = _temp->right;
                        _temp->left = Left_val;
                        _temp->right = Right_val;
                        Left_val->left = Left_Node;
                        Right_val->right = Right_Node;
                        queue_.pop();
                    }
                    break;
                } else {  // 通过上一层的父节点来扩展队列的子节点，父节点也会删除
                    int size = queue_.size();
                    int i = 1;
                    while (i <= size) {
                        TreeNode* Temp = queue_.front();
                        if (Temp->left != NULL) 
                            queue_.push(Temp->left);
                        if (Temp->right != NULL)
                            queue_.push(Temp->right);
                        i++;
                        queue_.pop();
                    }
                    height++;
                }
            }
            return root;
        }
    }

上面的截图看出，代码排名中等偏上一点吧，所以应该还是有改善的情况，可以进一步降低时间复杂度。