590. N-ary Tree Postorder Traversal（Tree）

链接：https://leetcode.com/problems/n-ary-tree-postorder-traversal/

题目：求n叉树的后续遍历

思路：与二叉树的后续遍历类似。

代码：

class Solution {
public:void post(Node* root){if(!root) return;    for(int i = 0;i < (root->children).size();i++)post(root->children[i]);ret.push_back(root->val);}vector<int> postorder(Node* root) {post(root);return ret;}private:vector<int>ret;
};

590. N-ary Tree Postorder Traversal（Tree）相关推荐

Leetcode 之Binary Tree Postorder Traversal（44）
后序遍历,比先序和中序都要复杂.访问一个结点前,需要先判断其右孩子是否被访问过.如果是,则可以访问该结点:否则,需要先处理右子树. vector<int> postorderTravers ...
[LeetCode] N-ary Tree Postorder Traversal N叉树的后序遍历
Given an n-ary tree, return the postorder traversal of its nodes' values. For example, given a 3-ary ...
590. N-ary Tree Postorder Traversal*
590. N-ary Tree Postorder Traversal* https://leetcode.com/problems/n-ary-tree-postorder-traversal/ 题 ...
[LeetCode] Binary Tree Postorder Traversal 二叉树的后序遍历
Given a binary tree, return the postorder traversal of its nodes' values. For example: Given binary ...
5. Binary Tree Postorder Traversal
Binary Tree Postorder Traversal Given a binary tree, return the postorder traversal of its nodes' va ...
【二叉树的迭代版后序遍历】LeetCode 145. Binary Tree Postorder Traversal
LeetCode 145. Binary Tree Postorder Traversal Solution1:递归版答案二叉树的后序遍历递归版是很简单的,关键是迭代版的代码既难理解又难写!但听了花 ...
【LeetCode】863. All Nodes Distance K in Binary Tree 解题报告（Python）
[LeetCode]863. All Nodes Distance K in Binary Tree 解题报告(Python) 作者: 负雪明烛 id: fuxuemingzhu 个人博客: http ...
C#LeetCode刷题之#590-N叉树的后序遍历（N-ary Tree Postorder Traversal）
问题该文章的最新版本已迁移至个人博客[比特飞],单击链接 https://www.byteflying.com/archives/4092 访问. 给定一个 N 叉树,返回其节点值的后序遍历. 例如 ...
Binary Tree Postorder Traversal
https://leetcode.com/problems/binary-tree-postorder-traversal/ Given a binary tree, return the posto ...

590. N-ary Tree Postorder Traversal（Tree）

590. N-ary Tree Postorder Traversal（Tree）相关推荐

最新文章

热门文章