LeetCode-589. N-ary Tree Preorder Traversal

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

For example, given a 3-ary tree:

Return its preorder traversal as: [1,3,5,6,2,4].

Note:

Recursive solution is trivial, could you do it iteratively?

题解：

class Solution {
public:static void preOrder(Node* root, vector<int> &ans) {if (root != NULL) {ans.push_back(root->val);for (int i = 0; i < root->children.size(); i++) {preOrder(root->children[i], ans);}    }}vector<int> preorder(Node* root) {vector<int> ans;preOrder(root, ans);return ans;}
};

LeetCode-589. N-ary Tree Preorder Traversal相关推荐

【二叉树迭代版前序遍历】LeetCode 144. Binary Tree Preorder Traversal
LeetCode 144. Binary Tree Preorder Traversal Solution1:递归版二叉树的前序遍历递归版是很简单的,前序遍历的迭代版相对是最容易理解的. 迭代版链接 ...
LeetCode：144_Binary Tree Preorder Traversal | 二叉树的前序遍历 | Medium
题目:Binary Tree Preorder Traversal 二叉树的前序遍历,同样使用栈来解,代码如下: 1 struct TreeNode { 2 int val; 3 TreeNode* ...
[Lintcode]66. Binary Tree Preorder Traversal/[Leetcode]144. Binary Tree Preorder Traversal
66. Binary Tree Preorder Traversal/144. Binary Tree Preorder Traversal 本题难度: Easy/Medium Topic: Bina ...
14 二叉树的前序遍历（Binary Tree Preorder Traversal）
文章目录 1 题目 2 描述 3 解决方案 3.1 递归算法 3.1.1 遍历法(Traverse) 思路源码 3.1.2 分治法(Devide And Conquer) 思路源码 3.2 非递归 ...
[LeetCode] 589. N-ary Tree Preorder Traversal
原题链接:https://leetcode.com/problems/n-ary-tree-preorder-traversal/ 1. 题目介绍 Given an n-ary tree, retur ...
leetcode 589. N-ary Tree Preorder Traversal
一题目 Given an n-ary tree, return the preorder traversal of its nodes' values. Nary-Tree input seriali ...
[LeetCode 题解]: Binary Tree Preorder Traversal
前言 [LeetCode 题解]系列传送门: http://www.cnblogs.com/double-win/category/573499.html 1.题目描述 Given a binary ...
589. N 叉树的前序遍历（javascript）589. N-ary Tree Preorder Traversal
给定一个 n 叉树的根节点 root ,返回其节点值的前序遍历 . n 叉树在输入中按层序遍历进行序列化表示,每组子节点由空值 null 分隔(请参见示例). Given the root of ...
[leetcode] Binary Tree Preorder Traversal
Given a binary tree, return the preorder traversal of its nodes' values. For example: Given binary t ...
leetcode 144. Binary Tree Preorder Traversal
Given a binary tree, return the preorder traversal of its nodes' values. For example: Given binary t ...

LeetCode-589. N-ary Tree Preorder Traversal

LeetCode-589. N-ary Tree Preorder Traversal相关推荐

最新文章

热门文章