看了下人家的递归解法,还是有点6,似懂非懂
给个自己比较简单的普通层次遍历解法吧
#include<iostream>
#include<vector>
#include<queue>
using namespace std;
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) {
queue<TreeNode*> q;
q.push(root);
int count=1;
while(!q.empty())
{
if(count==d-1||d==1)
break;
else
{
count++;
int n=(int)q.size();
for(int i=1;i<=n;i++)
{
TreeNode* node=q.front();
q.pop();
if(node->left!=NULL) q.push(node->left);
if(node->right!=NULL) q.push(node->right);
}
}
}
if(d==1)
{
TreeNode* x=new TreeNode(v);
x->left=root;
return x;
}
while(!q.empty())
{
TreeNode* node=q.front();
q.pop();
if(node->left!=NULL)
{
TreeNode* k=node->left;
TreeNode* x=new TreeNode(v);
node->left=x;
x->left=k;
}
else
{
TreeNode* x=new TreeNode(v);
node->left=x;
x->left=NULL;
}
if(node->right!=NULL)
{
TreeNode* k=node->right;
TreeNode* x=new TreeNode(v);
node->right=x;
x->right=k;
}
else
{
TreeNode* x=new TreeNode(v);
node->right=x;
x->right=NULL;
}
}
return root;
}
};