深度优先搜索——二叉树的层序遍历II

翻转 正序的结果即可

Java:

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public List<List<Integer>> levelOrderBottom(TreeNode root) {
       Queue<TreeNode> que=new LinkedList<TreeNode>();
        List<List<Integer>> lists=new ArrayList<>();
        if(root==null) return lists;
        que.offer(root);
        int size;
        while(!que.isEmpty()){
            size=que.size();
            List<Integer> list=new ArrayList<Integer>();
            while(size>0){
                root=que.poll();
                list.add(root.val);
                if(root.left!=null) que.offer(root.left);
                if(root.right!=null) que.offer(root.right);
                size--;
            }
            lists.add(list);
        }
        Collections.reverse(lists);//翻转
        return lists;
    }
}

 C++:

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    vector<vector<int>> levelOrderBottom(TreeNode* root) {
        queue<TreeNode*> que;
        vector<vector<int>> lists;
        if(root==nullptr) return lists;
        que.push(root);
        int size;
        while(!que.empty()){
            size=que.size();
            vector<int> list;
            while(size>0){
                root=que.front();
                que.pop();
                list.push_back(root->val);
                if(root->left) que.push(root->left);
                if(root->right) que.push(root->right);
                size--;
            }
            lists.push_back(list);
        }
        reverse(lists.begin(),lists.end());
        return lists;

    }
};