【leetcode】590. N-ary Tree Postorder Traversal

题目如下：

解题思路：凑数题+2，做完先序做后序。凑数博+2。

代码如下：

class Solution(object):def postorder(self, root):""":type root: Node:rtype: List[int]"""if root == None:return []res = []stack = [root]while len(stack) > 0:node = stack.pop(0)res.insert(0,node.val)for i in node.children:stack.insert(0, i)return res

转载于:https://www.cnblogs.com/seyjs/p/9397687.html

【leetcode】590. N-ary Tree Postorder Traversal相关推荐

【LeetCode】222. Count Complete Tree Nodes 解题报告（Python）
[LeetCode]222. Count Complete Tree Nodes 解题报告(Python) 标签(空格分隔): LeetCode 作者: 负雪明烛 id: fuxuemingzhu 个 ...
【LeetCode】106. Construct Binary Tree from Inorder and Postorder Traversal
Construct Binary Tree from Inorder and Postorder Traversal Given inorder and postorder traversal of ...
【Leetcode】431. Encode N-ary Tree to Binary Tree（困难）
一.题目 1.题目描述 Design an algorithm to encode an N-ary tree into a binary tree and decode the binary tre ...
【LeetCode】971. Flip Binary Tree To Match Preorder Traversal
题目地址: 971. Flip Binary Tree To Match Preorder Traversal 解析本题是关于二叉树翻转的题目,给定一个二叉树,对于其中的一个节点的翻转定义为该节点的 ...
【LeetCode】427. Construct Quad Tree 建立四叉树
作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 目录题目描述题目大意解题方法日期题目地址:https://leetcode.c ...
【leetcode】654. Maximum Binary Tree
题目如下: Given an integer array with no duplicates. A maximum tree building on this array is defined as ...
【二叉树的迭代版后序遍历】LeetCode 145. Binary Tree Postorder Traversal
LeetCode 145. Binary Tree Postorder Traversal Solution1:递归版答案二叉树的后序遍历递归版是很简单的,关键是迭代版的代码既难理解又难写!但听了花 ...
【leetcode】109. Convert Sorted List to Binary Search Tree
题目如下: Given a singly linked list where elements are sorted in ascending order, convert it to a heigh ...
【LeetCode】Minimum Depth of Binary Tree 二叉树的最小深度 java
[LeetCode]Minimum Depth of Binary Tree Given a binary tree, find its minimum depth. The minimum dept ...

【leetcode】590. N-ary Tree Postorder Traversal

【leetcode】590. N-ary Tree Postorder Traversal相关推荐

最新文章

热门文章