[leetcode-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层，然后将v结点插入到d层下，作为d层的子结点。

    TreeNode* addOneRow(TreeNode* root, int v, int d)
    {
      if( d == )
      {
    TreeNode* t = new TreeNode( v );
              t->left = root;
          root =t;
          return t;
      }
    queue< TreeNode* > qu;
    qu.push( root );
    int num1 = ;
    for( int i = ; i < d; i++ )
    {
      int num2 = ;
      while( num1-- >  )
      {
        TreeNode* p = qu.front();
        qu.pop();
        if( p->left != NULL )
        {
          num2++;
          qu.push( p->left );   
 
        }
        if( p->right != NULL )
        {
          num2++;
          qu.push( p->right );
        }              
 
      }
      num1 = num2;
    }
    int n = qu.size();
    for( int i = ; i < n ;i++ )
    {
      TreeNode* p = qu.front();
      qu.pop();
      TreeNode* q1 = new TreeNode( v );
      TreeNode* q2 = new TreeNode( v );
      q1->left = p->left;
      q2->right = p->right;
      p->left = q1;
      p->right = q2;
    }
      return root;
    }