给定一个二叉树,返回其节点值自底向上的层次遍历。 (即按从叶子节点所在层到根节点所在的层,逐层从左向右遍历)
例如:
给定二叉树 [3,9,20,null,null,15,7]
,
3 / \ 9 20 / \ 15 7
返回其自底向上的层次遍历为:
[ [15,7], [9,20], [3] ]
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution
{
public:
vector<vector<int> > result;
void levelTra(TreeNode *root, int level)
{
if(root == NULL)
return;
if(level == result.size())
{
vector<int> v;
result.push_back(v);
}
result[level].push_back(root->val);
levelTra(root->left, level+1);
levelTra(root->right, level+1);
}
vector<vector<int> > levelOrderBottom(TreeNode *root)
{
levelTra(root, 0);
return vector<vector<int> >(result.rbegin(), result.rend());
}
};
采用递归,每层数存一行。
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution
{
public:
vector<vector<int> > levelOrderBottom(TreeNode *root)
{
vector<vector<int> > result;
if(NULL == root)
return result;
queue<TreeNode *> q;
q.push(root);
while(!q.empty())
{
vector<int> layer;
for(int i = 0, n = q.size(); i < n; ++ i)
{
TreeNode *temp = q.front();
q.pop();
if(temp -> left != NULL)
q.push(temp -> left);
if(temp -> right != NULL)
q.push(temp -> right);
layer.push_back(temp -> val);
}
result.push_back(layer);
}
reverse(result.begin(), result.end());
return result;
}
};