LeetCode 0589 N-ary Tree Preorder Traversal【N叉树，DFS】

最新推荐文章于 2020-05-09 15:52:27 发布

原创最新推荐文章于 2020-05-09 15:52:27 发布 · 517 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

LeetCode 专栏收录该内容

51 篇文章

订阅专栏

本文探讨了N叉树的前序遍历算法，通过递归方式实现了节点值的遍历并返回结果。示例输入输出展示了算法的有效性，约束条件包括树的高度和节点总数。

Given an n-ary tree, return the preorder traversal of its nodes’ values.

Nary-Tree input serialization is represented in their level order traversal, each group of children is separated by the null value (See examples).

Follow up:

Recursive solution is trivial, could you do it iteratively?

Input: root = [1,null,3,2,4,null,5,6]
Output: [1,3,5,6,2,4]

Input: root = [1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14]
Output: [1,2,3,6,7,11,14,4,8,12,5,9,13,10

Constraints:

The height of the n-ary tree is less than or equal to 1000
The total number of nodes is between [0, 10^4]

题意

N叉树前序遍历

思路1

递归实现

代码1

/*
// 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> ans;
        if(root != NULL)
            dfs(root, ans);
        return ans;
    }
    
    void dfs(Node *node, vector<int> &ans){
        if(node == NULL) return;
        ans.push_back(node->val);
        for(const auto &item : node->children)
            dfs(item, ans);
    }
};