[leetcode] 107. Binary Tree Level Order Traversal II

[leetcode] 107. Binary Tree Level Order Traversal II

题目链接：https://leetcode.com/problems/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]
]

思路

这是一个层次遍历，我们知道如果只是层次遍历的话可以用一个队列来保存节点，先入先出。现在我们还需要一个节点的处于第几层的信息，和一个当前层数，这样当我们发现队列中的节点和当前层数一样就放到当前数组中，否则就将当前数组中的值存入结果集合中，并且清空数组。最后再将结果反转一下即可（这和I的唯一区别）

/**
 * 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) {
        vector<vector<int>> result;
        if(!root) return result;
        queue<TreeNode*> que;//结点队列
        que.push(root);
        queue<int> depth;//深度队列
        depth.push(0);
        vector<int> tem;
        while(!que.empty()){
            TreeNode* node = que.front();
            int curDepth = depth.front();
            if(node->left){
                que.push(node->left);
                depth.push(depth.front() + 1);
            }
            if(node->right){
                que.push(node->right);
                depth.push(curDepth + 1);
            }
            depth.pop();
            que.pop();
            tem.push_back(node->val);
            //如果队列空了或者当前的层数和下一个结点的层数不一样，则说明当前层已经遍历完了
            if(depth.empty() || curDepth != depth.front()){
            result.push_back(tem);
                tem.clear();
            }
        }
        reverse(result.begin(),result.end());
        return result;
    }
};

思路

递归的二分数组，取数组中间的一个数为根，左边的为左子树，右边的为右子树。

/**
 * 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:
    TreeNode* convert(vector<int>& nums,int start,int end){
        if(start > end) return NULL;
        int mid = (start + end) / 2;
        TreeNode* root = new TreeNode(nums[mid]);
        root->left = convert(nums,start,mid - 1);
        root->right = convert(nums,mid+1,end);
        return root;
    }
    TreeNode* sortedArrayToBST(vector<int>& nums) {
        int len = nums.size();
        if(len == 0) return NULL;
        return convert(nums,0,len - 1);
    }
};