623. Add One Row to Tree

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.

Example 1:

Input: 
A binary tree as following:
       4
     /   \
    2     6
   / \   / 
  3   1 5   

v = 1

d = 2

Output: 
       4
      / \
     1   1
    /     \
   2       6
  / \     / 
 3   1   5   

Example 2:

Input: 
A binary tree as following:
      4
     /   
    2    
   / \   
  3   1    

v = 1

d = 3

Output: 
      4
     /   
    2
   / \    
  1   1
 /     \  
3       1

Note:

1. The given d is in range [1, maximum depth of the given tree + 1].
2. The given binary tree has at least one tree node.

思路：找到d-1层，记录下该层的每一个节点，然后对每一个节点进行加node操作

知识点：广度优先，利用queue

代码1：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    TreeNode* addOneRow(TreeNode* root, int v, int d) {
        if(d==1){
            TreeNode* node=new TreeNode(v);
            node->left = root;
            return node;
        }
        queue<TreeNode*> s;
        s.push(root);
        while(d-2){
            int len=s.size();
            for(int i=0;i<len;i++){
                TreeNode* node;
                node = s.front();
                if(node->left){s.push(node->left);}
                if(node->right){s.push(node->right);}
                s.pop();
            }
            
            d--;
        }
        int len=s.size();
        for(int i=0;i<len;i++){
            TreeNode* nod=s.front();
            //if(nod->left){
                TreeNode* node=new TreeNode(v);
                node->left = nod->left;
                nod->left = node;
            //}
             //if(nod->right){
                TreeNode* node2=new TreeNode(v);
                node2->right = nod->right;
                nod->right = node2;
            //}
            s.pop();
        }
        return root;
    }
};

代码2：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    TreeNode* addOneRow(TreeNode* root, int v, int d) {
        if(d==1){
            TreeNode* head=new TreeNode(v);
            head->left=root;
            return head;
        }
        
        queue<TreeNode*> s;
        s.push(root);
        while(d-2){
            int loop=s.size();
            while(loop){
                TreeNode* cur;
                cur = s.front();
                s.pop();
                if(cur->left){s.push(cur->left);}
                if(cur->right){s.push(cur->right);}
                loop--;
            }
            d--;
        }
        while(!s.empty()){
            TreeNode* cur, *next;
            cur = s.front();
            s.pop();
            if(1){
                next=cur->left;
                TreeNode* p = new TreeNode(v);
                cur->left=p;
                p->left=next;
            }
            if(1){
                next=cur->right;
                TreeNode* p = new TreeNode(v);
                cur->right=p;
                p->right=next;
            }
        }
        return root;
    }
};

代码3：