leetcode107.Binary Tree Level Order Traversal II

Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).

For example:
Given binary tree {3,9,20,#,#,15,7},

    3
   / \
  9  20
    /  \
   15   7

return its bottom-up level order traversal as:

[
  [15,7],
  [9,20],
  [3]
]

解题思路：层次遍历二叉树，不过按照倒序输出，其中vector数组可以实现逆序。

代码如下：

/**
 * 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:
    vector<vector<int>> result;
    void Traverse(TreeNode *root,int level)
    {
        if(!root)
        {
            return;
        }
        if(result.size()==level)
        {
            result.push_back(vector<int>());
         
        
        }
        result[level].push_back(root->val);
           Traverse(root->left,level+1);
            Traverse(root->right,level+1);
    }
        
    vector<vector<int>> levelOrderBottom(TreeNode* root)
    {
        Traverse(root,0);
        return vector<vector<int> >(result.rbegin(), result.rend());
    }
};