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 vas 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.

示例:

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   

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的结点，原先节点的左子树变为插入节点的左子树，原先节点的右子树变为插入节点的右子树。遍历时可采用根的先序遍历。

过程详见代码：

/**
 * 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* tree = new TreeNode(v);
			tree->left = root;
			return tree;
		}
		bl(root, v, d - 1, 1);
		return root;
	}

	void bl(TreeNode* root, int v, int d,int depth)
	{
		if (root == nullptr) return;
		if (depth == d)
		{
			TreeNode* left = new TreeNode(v);
			TreeNode* right = new TreeNode(v);
			left->left = root->left;
			right->right = root->right;
			root->left = left;
			root->right = right;
			return;
		}
		bl(root->left, v, d, depth + 1);
		bl(root->right, v, d, depth + 1);
	}
};