【树】leetcode_102_ 二叉树的层序遍历

【树】leetcode_102_ 二叉树的层序遍历

/**
 * 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) {
        vector<vector<int>> result;
        
        vector<int> node_level;
        TreeNode *cur = root;
        
        queue<TreeNode*> q_node;

        if(cur == nullptr) return result;
        q_node.push(cur);
        while(!q_node.empty()){

            node_level = {};
            int q_size = q_node.size();

            for (int i=0; i<q_size; i++){
                cur = q_node.front();
                q_node.pop();
                node_level.push_back(cur->val);
                if (cur->left) q_node.push(cur->left);
                if (cur->right) q_node.push(cur->right);
            }
            result.push_back(node_level);
        }
         reverse(result.begin(),result.end());
        return result;
    }
};

返回1个vector的

class Solution {
public:
    vector<vector<int>> levelOrder(TreeNode* root) {
        vector<vector<int>> rtt;
        vector<int> result;
        queue<TreeNode*> re;
        re.push(root);
        TreeNode *cur = root;
        while (!re.empty()){
            cur = re.front();
            if(cur->left){
                re.push(cur->left);
            }
            if(cur->right){
                re.push(cur->right);
            }

            
            re.pop();
            int tmp = cur->val;
            result.push_back(tmp);
        }
        for(int i : result){
                cout << i << endl;
            }
        return rtt;

    }
};