Leetcode——107. 二叉树的层次遍历 II

思路：
1.递归

/**
 * 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:
    void visit(TreeNode* root,vector<vector<int> > & ve ,int level)
    {
        if(root!=NULL)
        {
            int ceng=ve.size();
            if(level>ceng)
            {
                vector<int> tempvector;
                tempvector.push_back(root->val);
                ve.push_back(tempvector);
                visit(root->left,ve,level+1);
                visit(root->right,ve,level+1);
            }
            else
            {
                ve[level-1].push_back(root->val);
                visit(root->left,ve,level+1);
                visit(root->right,ve,level+1);
            }
        }
    }
    vector<vector<int>> levelOrderBottom(TreeNode* root) 
    {
        vector<vector<int> > ve;
        visit(root,ve,1);    
        reverse(ve.begin(),ve.end());
        return ve;
    }
};

2.bfs

/**
 * 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>> levelOrderBottom(TreeNode* root) 
    {
        queue<TreeNode*> q;
        vector<vector<int> > ve;
        q.push(root);
        while(q.size()!=0)
        {
            vector<int> tempvector;
            int len=q.size();
            for(int i=0;i<len;i++)
            {
                TreeNode* temp=q.front();
                if(temp!=NULL)
                {
                    tempvector.push_back(temp->val);
                    q.push(temp->left);
                    q.push(temp->right);
                }
                q.pop();
            }
            if(tempvector.size()!=0)
                ve.push_back(tempvector);
        }   
        reverse(ve.begin(),ve.end()); 
        return ve;
    }
};