刷题-Leetcode-面试题 04.03. 特定深度节点链表

面试题 04.03. 特定深度节点链表

题目链接

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/list-of-depth-lcci/submissions/
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

题目分析

参考链接：c++超100的广度优先

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    vector<ListNode*> listOfDepth(TreeNode* tree) {
        vector<ListNode*> res;
        if(tree == nullptr) return res;
        queue<TreeNode*> queue;
        queue.push(tree);
        while(!queue.empty()){
            ListNode* head = nullptr;
            ListNode* curNode = nullptr;
            int n = queue.size();
            while(n--){
                TreeNode* curTree = queue.front();
                queue.pop();
                ListNode* newNode = new ListNode(curTree->val);
                if(head == nullptr){
                    head = newNode;
                }else{
                    curNode->next = newNode;
                }
                curNode = newNode;
                if(curTree->left) queue.push(curTree->left);
                if(curTree->right) queue.push(curTree->right); 
            }
            res.emplace_back(head);
        }
        return res;
    }
};