LeetCode 589. N 叉树的前序遍历 & 590. N 叉树的后序遍历 & 429. N 叉树的层序遍历

题目：

【589：https://leetcode.cn/problems/n-ary-tree-preorder-traversal/description/】

【590：https://leetcode.cn/problems/n-ary-tree-postorder-traversal/description/】

【429：https://leetcode.cn/problems/n-ary-tree-level-order-traversal/】

        给定一个 n 叉树的根节点 root ，返回 其节点值的前序遍历或后序遍历或层序遍历

示例：

​

输入：root = [1,null,3,2,4,null,5,6]

前序遍历输出：[1,3,5,6,2,4]
后序遍历输出：[5,6,3,2,4,1]
层序遍历输出：[[1],[3,2,4],[5,6]]

代码：

/*
// Definition for a Node.
class Node {
public:
    int val;
    vector<Node*> children;

    Node() {}

    Node(int _val) {
        val = _val;
    }

    Node(int _val, vector<Node*> _children) {
        val = _val;
        children = _children;
    }
};
*/

class Solution {
public:
    // 前序遍历
    vector<int> preorder(Node* root) {
        vector<int> res;
        traverseForPreOrder(root, res);
        return res;  
    }
    void traverseForPreOrder(Node* node, vector<int>& res) {
        if (node == nullptr) {
            return;
        }

        res.emplace_back(node->val);
        for (auto ch : node->children) {
            traverseForPreOrder(ch, res);
        }
    }


    // 后序遍历
    vector<int> postorder(Node* root) {
        vector<int> res;
        traverseForPostOrder(root, res);
        return res;
    }
    void traverseForPostOrder(Node* node, vector<int>& res) {
        if (node == nullptr) {
            return;
        }

        for (auto child : node->children) {
            traverseForPostOrder(child, res);
        }
        res.push_back(node->val);
    }

    // 层序遍历
    vector<vector<int>> levelOrder(Node* root) {
        if (root == nullptr) {
            return {};
        }

        vector<vector<int>> res;
        queue<Node*> q;
        q.push(root);

        while (!q.empty()) {
            vector<int> curLevel;
            int curLevelSize = q.size();

            for (int i = 0; i < curLevelSize; i++) {
                auto curNode = q.front();
                q.pop();
                curLevel.push_back(curNode->val);
                for (auto child : curNode->children) {
                    q.push(child);
                }
            }
            res.push_back(curLevel);
        }
        return res;
    }
};